Goal-directed E-unification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2051, Issue , 2001, Pages 231-245

  Lynch, Christopher ^a   Morawska, Barbara ^a  

^a CLARKSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYNTACTICS;

E-UNIFICATION; E-UNIFICATION PROBLEMS; EQUATIONAL THEORY; GOAL DIRECTED; INFERENCE RULES; INFERENCE SYSTEMS; SYNTACTIC THEORY;

FORMAL LOGIC;

EID: 34248365012     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-45127-7_18     Document Type: Article

References (16)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.
2. L. Bachmair, N. Dershowitz, D. Plaisted. Completion without failure. In Resolution of Equations in Algebraic Structures, ed. H. Ait-Kaci, M. Nivat, vol. 2, 1-30, Academic Press, 1989.
3. D. Brand. Proving theorems with the modification method. in SIAM J. Computing 4, 412-430, 1975.
4. J. Gallier and W. Snyder. Complete sets of transformations for general E-unification. In TCS, vol. 67, 203-260, 1989.
5. S. Holldobler. Foundations of Equational Logic Programming Lecture Notes in Artificial Intelligence 353, Springer-Verlag, 1989.
6. G. Huet. Resolution d'equations dans les langages d'ordre 1, 2.,ω.These d'Etat, Universite Paris VII, 1976.
7. J.-M. Hullot. Canonical Forms and Unification. In Proc. 5th Conf. on Automated Deduction, Les Arcs, Vol. 87 of Lecture Notes in Computer Science, Springer-Verlag, 1980.
8. C. Kirchner. Computing unification algorithms. In Proceedings of the First Symposium on Logic in Computer Science, Boston, 200-216, 1990.
9. C. Kirchner and H. Kirchner. Rewriting, Solving, Proving. http://www.loria.fr/˜ckirchne/, 2000.
10. C. Kirchner and F. Klay. Syntactic Theories and Unification. In LICS 5, 270-277, 1990.
11. F. Klay. Undecidable Properties in Syntactic Theories. In RTA 4, ed. R. V. Book, LNCS vol. 488, 136-149, 1991.
12. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebra. In Computational Problems in Abstract Algebra, ed. J. Leech, 263-297, Pergamon Press, 1970.
13. C. Lynch and B. Morawska. Goal Directed E-Unification. http://www.clarkson.edu/˜clynch/PAPERS/goal-long.ps/, 2001.
14. C. Lynch and B. Morawska. Approximating E-Unification. http://www.clarkson.edu/˜clynch/PAPERS/approx.ps/, 2001.
15. C. Lynch and B. Morawska. Decidability and Complexity of Finitely Closable Linear Equational Theories. http://www.clarkson.edu/˜clynch/PAPERS/ linear.ps/, 2001.
16. A. Middeldorp, S. Okui, T. Ida. Lazy Narrowing: Strong Completeness and Eager Variable Elimination. In Theoretical Computer Science 167(1,2), pp. 95-130, 1996.