An algebra of resolution

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

Volumn 1833, Issue , 2000, Pages 214-228

  Struth, Georg ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC RECONSTRUCTION; BUCHBERGER ALGORITHMS; DISTRIBUTIVE LATTICE; REDUNDANCY ELIMINATION; REFUTATIONAL COMPLETENESS; SEMILATTICES; TRANSITIVE RELATION; WORD PROBLEM;

ALGEBRA;

EID: 23044519985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10721975_15     Document Type: Conference Paper

References (18)

1. L. Bachmair. Canonical Equational Proofs. Birkhäuser, 1991.
2. L. Bachmair, N. Dershowitz, and D.A. Plaisted. Completion without failure. In H. Äıt-Kacy and M. Nivat, editors, Resolution of Equations in Algebraic Structures, volume 2: Rewriting Techniques, chapter 1, pages 1–30. Academic Press, 1989.
3. L. Bachmair and D. Plaisted. Termination orderings for associative-commutative rewriting systems. J. Symbolic Computation, 1(4):329–349, 1985.
4. B. Buchberger. Basic features and development of the critical-pair/completion procedure. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, [1st International Conference], volume 202 of LNCS, pages 1–45. Springer-Verlag, 1985.
5. R. Bündgen. Buchberger’s algorithm: The term rewriter’s point of view. Theoretical Computer Science, 159(2):143–190, 1996.
6. C. Delor and L. Puel. Extension of the associative path ordering to a chain of associative-commutative symbols. In C. Kirchner, editor, Rewriting Techniques and Applications, volume 690 of LNCS, pages 389–404. Springer-Verlag, 1993.
7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6, pages 244–320. Elsevier, 1990.
8. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Comput., 15:1155–1194, 1986.
9. P. Le Chenadec. Canonical Forms in Finitely Presented Algebras. Research Notes in Theoretical Computer Science. Pitman [u.a.], London;New York;Toronto, 1986.
10. A. Leitsch. The Resolution Calculus. Springer-Verlag, 1997.
11. J. Levy and J. Agustí. Bi-rewrite systems. J. Symbolic Computation, 22:279–314, 1996.
12. P. Lorenzen. Algebraische und logistische Untersuchungen über freie Verbände. The Journal of Symbolic Logic, 16(2):81–106, 1951.
13. U. Martin and T. Nipkow. Ordered rewriting and confluence. In M. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of LNCS, pages 366–380. Springer-Verlag, 1990.
14. R. Socher-Ambrosius. Boolean algebra admits no convergent term rewriting system. In R.E. Book, editor, 4th International Conference on Rewriting Techniques and Applications, volume 488 of LNCS, pages 264–274. Springer-Verlag, 1991.
15. G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut für Informatik, Saarbrücken, 1996.
16. G. Struth. On the word problem for free lattices. In H. Comon, editor, Rewriting Techniques and Applications, 8th International Conference, RTA-97, volume 1232 of LNCS, pages 128–141. Springer, 1997.
17. G. Struth. Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut für Informatik, Universität des Saarlandes, 1998.
18. G.S. Tseitin. On the complexity of derivation in propositional calculus. In J. Siek-mann and G. Wrightson, editors, Automation of Reasoning, volume 2, pages 466–483. Springer-Verlag, 1983. reprint.