Positive deduction modulo regular theories

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

Volumn 1092, Issue , 1996, Pages 468-484

  Vigneron, Laurent ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; INFERENCE ENGINES; RECONFIGURABLE HARDWARE;

DEDUCTION MODULO; EQUATIONAL THEORY; INFERENCE RULES; ORDERING STRATEGY; REFUTATIONAL COMPLETENESS; THEOREM PROVERS;

COMPUTATION THEORY;

EID: 84957718726     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_54     Document Type: Conference Paper

References (31)

1. L. Bachmair and N. Dershowitz. Completion for Rewriting Modulo a Congruence. Theoretical Computer Science, 67(2-3):173-202, October 1989.
2. L. Bachmair and H. Ganzinger. On Restrictions of Ordered Paramodulation with Simpfification. In M. E. Stickel, editor, Proceedings 10th International Conference on Automated Deduction, Kaiserslautern (Germany), volume 449 of Lecture Notes in Computer Science, pages 427-441. Springer-Verlag, July 1990.
3. L. Bachmair and H. Ganzinger. Rewrite-based Equational Theorem Proving with Selection and Simplification. Journal of Logic and Computation, 4(3):1-31, 1994.
4. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic Paramodulation. Information and Computation, 121(2):172-192, 1995.
5. L. Bachmair and D. Plaisted. Associative Path Orderings. In Proceedings 1st Conference on Rewriting Techniques and Applications, Dijon (France), volume 202 of Lecture Notes in Computer Science. Springer-Verlag, 1985.
6. D. Brand. Proving Theorems with the Modification Method. SIAM Journal of Computing, 4:412-430, 1975.
7. C. Delor and L. Puel. Extension of the Associative Path Ordering to a Chain of Associative Symbols. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 389-404. Springer-Verlag, 1993.
8. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers B. V. (North-Holland), 1990.
9. A. Fortenbacher. Effizientes Rechnen in AC-Gleichungstheorien. PhD thesis, Universität Karlsruhe (Germany), February 1989.
10. J. Hsiang and M. Rusinowitch. Proving Refutational Completeness of Theorem Proving Strategies: The Transfinite Semantic Tree Method. Journal of the ACM, 38(3):559-587, July 1991.
11. J.-M. Hullot. Compilation de Formes Canoniques dans les Théories équationelles. Thèse de Doctorat de Troisième Cycle, Université de Paris Sud, Orsay (France), 1980.
12. J.-P. Jouannaud and C. Kirchner. Solving Equations in Abstract Algebras: a Rulebased Survey of Unification. In Jean-Louis Lassez and G. Plotkin, editors, Computational Logic. Essays in honor of Alan Robinson, chapter 8, pages 257-321. MIT Press, Cambridge (MA, USA), 1991.
13. J.-P. Jouannaud and H. Kirchner. Completion of a Set of Rules Modulo a Set of Equations. SlAM Journal of Computing, 15(4):1155-1194, 1986. Preliminary version in Proceedings llth ACM Symposium on Principles of Programming Languages, Salt Lake City (USA), 1984.
14. D. S. Lankford and A. Ballantyne. Decision Procedures for Simple Equational Theories with Associative Commutative Axioms: Complete Sets of Associative Commutative Reductions. Technical report, Univ. of Texas at Austin, Dept. of Mathematics and Computer Science, 1977.
15. C. Marché. Réécriture modulo une théorie présentée par un système convergent et décidabilité du probléme du mot dans eertaines classes de théories équationnelles. Thèse de Doctorat d'Université, Université de Paris-Sud, Orsay (France), October 1993.
16. R. Nieuwenhuis and A. Rubio. Basic Superposition is Complete. In B. Krieg- Briiekner, editor, Proceedings of ESOP'92, volume 582 of Lecture Notes in Computer Science, pages 371-389. Springer-Verlag, 1992.
17. E. Paul (E-mail: etienne.paul@issy.cnet.fr). E-Semantic Tree. Unpublished paper, 70 pages, 1994.
18. G. E. Peterson. A Technique for Establishing Completeness Results in Theorem Proving with Equality. SIAM Journal of Computing, 12(1):82-100, 1983.
19. G. E. Peterson and M. E. Stickel. Complete Sets of Reductions for Some Equational Theories. Journal of the ACM, 28:233-264, 1981.
20. G. Plotkin. Building-in Equational Theories. Machine Intelligence, 7:73-90, 1972.
21. J. A. Robinson. A Machine-oriented Logic Based on the Resolution Principle. Journal of the ACM, 12:23-41, 1965.
22. A. Rubio and R. Nieuwenhuis. A Precedence-Based Total AC-Compatible Ordering. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 374-388. Springer-Verlag, 1993.
23. M. Rusinowitch. Démonstration automatique– Techniques de réécriture. InterEditions, 1989.
24. M. Rusinowitch. Theorem-proving with Resolution and Superposition. Journal of Symbolic Computation, 11:21-49, 1991.
25. M. Rusinowitch and L. Vigneron. Associative Commutative Deduction. In E. Domenjoud and Claude Kirchner, editors, Proceedings of the 1st CCL Workshop, Le Val d'Ajol (France), October 1992.
26. M. Rusinowitch and L. Vigneron. Automated Deduction with Associative-Commutative Operators. Applicable Algebra in Engineering, Communication and Computing, 6(1):23-56, January 1995.
27. M. E. Stickel. A Unification Algorithm for Associative-Commutative Functions. Journal of the ACM, 28:423-434, 1981.
28. L. Vigneron. Associative-Commutative Deduction with Constraints. In A. Bundy, editor, Proceedings 12th International Conference on Automated Deduction, Nancy (France), volume 814 of Lecture Notes in Artificial Intelligence, pages 530-544. Springer-Verlag, June 1994.
29. L. Vigneron. Automated Deduction with Symbolic Constraints in Equational Theories. PhD Thesis, Université Henri Poincaré- Nancy 1, November 1994. Available as Research Report CRIN 94-T-266 (in French).
30. L. Vigneron. Theorem Proving modulo Regular Theories. Technical report 95-1, Department of Computer Science, SUNY at Stony Brook, Stony Brook, January 1995.
31. U. Wertz. First-Order Theorem Proving Modulo Equations. Technical Report MPI-I-92-216, Max Planck Institut für Informatik, April 1992.