Superposition for fixed domains

ACM Transactions on Computational Logic

Volumn 11, Issue 4, 2010, Pages 1-35

  Horbach, Matthias ^a   Weidenbach, Christoph ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Automated theorem proving; Fixed domain semantics; Inductionless induction; Minimal model semantics; Proof by consistency; Superposition

Indexed keywords

FORMAL LOGIC; SEMANTICS;

AUTOMATED THEOREM PROVING; DOMAIN SEMANTICS; INDUCTIONLESS INDUCTION; MINIMAL MODEL SEMANTICS; PROOF BY CONSISTENCY; SUPERPOSITION;

CALCULATIONS;

EID: 77954970352     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1805950.1805957     Document Type: Article

References (28)

1. ARMANDO, A., BONACINA, M. P., RANISE, S., AND SCHULZ, S. 2009. New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Logic 10, 1, 129-179.
2. BACHMAIR, L. AND GANZINGER, H. 1994. Rewrite-based equational theorem proving with selection and simplification. J. Logic Computat. 4, 3, 217-247.
3. BACHMAIR, L., GANZINGER, H., AND WALDMANN, U. 1993. Superposition with simplification as a decision procedure for the monadic class with equality. In Proceedings of the 3rd Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC'93). Lecture Notes in Computer Science, vol. 713. Springer-Verlag, Berlin, 83-96.
4. BOUHOULA, A. 1997. Automated theorem proving by test set induction. J. Symb. Computat. 23, 1, 47-77.
5. BOUHOULA, A. AND JOUANNAUD, J.-P. 1997. Automata-driven automated induction. In Proceedings of the 12th IEEE Symposium on Logic in Computer Science. IEEE, 14.
6. CAFERRA, R. AND ZABEL, N. 1992. A method for simultanous search for refutations and models by equational constraint solving. J. Symb. Computat. 13, 6, 613-642.
7. COMON, H. 1991. Disunification: A survey. In Computational Logic: Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotkin, Eds. MIT Press, Cambridge, MA, 322-359.
8. COMON, H. AND JACQUEMARD, F. 1997. Ground reducability is exptime-complete. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97). IEEE Computer Society Press, Los Alamitos, CA, 26-34.
9. COMON, H. AND LESCANNE, P. 1989. Equational problems and disunification. J. Symb. Computat. 7, 3-4, 371-425.
10. COMON, H. AND NIEUWENHUIS, R. 2000. Induction = I-axiomatization + first-order consistency. Inf. Computat. 159, 1/2 (May), 151-186.
11. FALKE, S. AND KAPUR, D. 2006. Inductive Decidability Using Implicit Induction. In Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'06). Lecture Notes in Artificial Intelligence, vol. 4246. Springer-Verlag, Berlin, 45-59.
12. GANZINGER, H. AND NIVELLE, H. D. 1999. A superposition decision procedure for the guarded fragment with equality. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 295-305.
13. GANZINGER, H. AND STUBER, J. 1992. Inductive theorem proving by consistency for first-order clauses. In Informatik - Festschrift zum 60. Geburtstag von GunterHotz, J. Buchmann, H. Ganzinger, and W. Paul, Eds. Teubner, 441-462. Lecture Notes in Computer Science, vol. 656, Springer-Verlag, Berlin.
14. GIESL, J. AND KAPUR, D. 2003. Deciding inductive validity of equations. In Proceedings of the 19th International Conference on Automated Deduction (CADE'19). Lecture Notes in Computer Science, vol. 2741. Springer, Berlin, 17-31.
15. HORBACH, M. AND WEIDENBACH, C. 2009a. Decidability results for saturation-based model building. In Proceedings of the 22nd International Conference on Automated Deduction (CADE'22), Lecture Notes in Artificial Intelligence, vol. 5663. Springer-Verlag, Berlin, 404-420.
16. * queries. In Proceedings of the 18th Annual Conference of the European Association for Computer Science Logic (CSL'09), Lecture Notes in Computer Science, vol. 5771. Springer-Verlag, Berlin, 332-347.
17. HUSTADT, U., SCHMIDT, R. A., AND GEORGIEVA, L. 2004. A survey of decidable first-order fragments and description logics. J. Relat. Meth. Comput. Sci. 1, 251-276.
18. JACQUEMARD, F., MEYER, C, AND WEIDENBACH, C. 1998. Unification in extensions of shallow equational theories. In Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA98). Lecture Notes in Computer Science, vol. 1379. Springer-Verlag, Berlin, 76-90.
19. JACQUEMARD, F., RUSINOWITCH, M., AND VIGNERON, L. 2006. Tree automata with equality constraints modulo equational theories. In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06). Lecture Notes in Computer Science, vol. 4130. Springer-Verlag, Berlin, 557-571.
20. KAPUR, D., NARENDRAN, P., AND ZHANG, H. 1991. Automating inductionless induction using test sets. J. Symb. Computat. 11, 1/2, 81-111.
21. KAPUR, D. AND SUBRAMANIAM, M. 2000. Extending decision procedures with induction schemes. In Proceedings of the 17th International Conference on Automated Deduction (CADE'17). Lecture Notes in Computer Science, vol. 1831. Springer-Verlag, Berlin, 324-345.
22. KOUNALIS, E. 1992. Testing for the ground (co-) reducibility property in term-rewriting systems. Theoret. Comput. Sci. 106, 1, 87-117.
23. NIEUWENHUIS, R. 1996. Basic paramodulation and decidable theories (extended abstract). In Proceedings of the 11th IEEE Symposium on Logic in Computer Science (LICS'96). IEEE Computer Society Press, Los Alamitos, CA, 473-482.
24. NIEUWENHUIS, R. AND RUBIO, A. 2001. Paramodulation-based theorem proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Vol. I. Elsevier, Amsterdam, The Netherlands, Chapter 7, 371-443.
25. PELTIER, N 2003. Model building with ordered resolution: extracting models from saturated clause sets. J. Symb. Computat. 36, 1-2, 5-48.
26. PLAISTED, D. A. 1985. Semantic confluence tests and completion methods. Inform. Cont. 65, 2/3, 182-215.
27. WEIDENBACH, C. 1999. Towards an automatic analysis of security protocols in first-order logic. In Proceedings of the 16th International Conference on Automated Deduction (CADE'16), H. Ganzinger, Ed. Lecture Notes in Artificial Intelligence, vol. 1632. Springer-Verlag, Berlin, 378-382.
28. WEIDENBACH, C. 2001. Combining superposition, sorts and splitting. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Vol. 2. Elsevier, Amsterdam, The Netherlands, Chapter 27, 1965-2012.