Superposition with simplification as a decision procedure for the monadic class with equality

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

Volumn 713 LNCS, Issue , 1993, Pages 83-96

  Bachmair, Leo ^a   Ganzinger, Harald ^b   Waldmann, Uwe ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS;

DECISION PROCEDURE; PARAMODULATION; SIMPLIFICATION RULES;

LOGIC PROGRAMMING;

EID: 84976622432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0022557     Document Type: Conference Paper

References (18)

1. W. ACKERMANN, 1954. Solvable Cases of the Decision Problem. North-Holland, Amsterdam.
2. A. AIKEN AND E. L. WIMMERS, 1992. Solving Systems of Set Constraints (Extended Abstract). In Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, USA, pp. 329-340. IEEE Computer Society Press.
3. L. BACHMAIR AND H. GANZINGER, 1990. On Restrictions of Ordered Paramodulation with Simplification. In M. E. Stickel, editor, 10th International Conference on Automated Deduction, Kaiserslautern, FRG, LNAI 449, pp. 427-441. Springer-Verlag.
4. L. BACHMAIR AND H. GANZINGER, 1991. Rewrite-Based Equational Theorem Proving With Selection and Simplification. Technical Report MPI-I-91-208, Max-Planck-Institut für Informatik, Saarbrücken. Revised version to appear in Journal of Logic and Computation.
5. L. BACHMAIR, H. GANZINGER AND U. WALDMANN, 1992. Set Constraints are the Monadic Class. Technical Report MPI-I-92-240, Max-Planck-Institut fiir Informatik, Saarbriicken. Revised version to appear in Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, 1993.
6. H. COMON, M. HABERSTRAU AND J.-P. JOUANNAUD, 1992. Decidable Problems in Shallow Equational Theories (Extended Abstract). In Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, USA, pp. 255-265. IEEE Computer Society Press.
7. N. DERSHOWITZ AND J.-P. JOUANNAUD, 1990. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 6, pp. 243-320. Elsevier Science Publishers B.V., Amsterdam, New York, Oxford, Tokyo.
8. B. DREBEN AND W.D. GOLDFARB, 1979. The Decision Problem. Solvable Classes of Quantificational Formulas. Addison-Wesley Publishing Company, Inc.
9. C. FERMÜLLER, A. LEITSCH, T. TAMMET AND N. ZAMOV, 1992. Resolution Methods for the Decision Problem. To appear.
10. C. FERMÜLLER AND G. SALZER, 1993. Ordered Paramodulation and Resolution as Decision Procedure. Submitted.
11. N. HEINTZE AND J. JAFFAR, 1991. Set-based program analysis. Draft manuscript.
12. W. H. JOYNER JR., 1976. Resolution Strategies as Decision Procedures. Journal of the ACM, Vol. 23, No. 3, pp. 398-417.
13. H. R. LEWIS, 1980. Complexity Results for Classes of Quantificational Formulas. Journal of Computer and System Sciences, Vol. 21, pp. 317-353.
14. L. LÖWENHEIM, 1915. Über Möglichkeiten im Relativkalkiil. Math. Annalen, Vol. 76, pp. 228-251.
15. R. NIEUWENHUIS AND A. RUBIO, 1992. Theorem Proving with Ordering Constrained Clauses. In D. Kapur, editor, 11th International Conference on Automated Deduction, Saratoga Springs, New York, USA, LNAI 607, pp. 477-491. Springer-Verlag.
16. P. NIVELA AND R. NIEUWENHUIS, 1993. Practical results on saturation of full firstorder clauses: Experiments with the Saturate system. Submitted.
17. M. RUSINOWITCH, 1989. Démonstration A utomatique: Techniques de Réécriture. Intereditions, Paris, France.
18. M. RUSINOWITCH, 1991. Theorem proving with resolution and superposition: An extension of the Knuth and Bendix completion procedure as a complete set of inference rules. Journal of Symbolic Computation, Vol. 11.