Superposition with equivalence reasoning and delayed clause normal form transformation

Information and Computation

Volumn 199, Issue 1-2, 2005, Pages 3-23

  Ganzinger, Harald ^a   Stuber, Jürgen ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b NONE   (Germany)

Author keywords

Automated theorem proving; Clause normal form transformation; Deduction; First order logic; Logical equivalence; Paramodulation; Rewriting; Set theory; Superposition

Indexed keywords

AUTOMATA THEORY; DATA STRUCTURES; FORMAL LOGIC; INTEGRATION; MODULATION; SET THEORY;

AUTOMATED THEOREM PROVING; CLAUSE-NORMAL-FORM TRANSFORMATION; DEDUCTION; FIRST-ORDER LOGIC; LOGICAL EQUIVALENCE; PARAMODULATION; REWRITING; SUPERPOSITION;

THEOREM PROVING;

EID: 20144366475     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.10.010     Document Type: Conference Paper

References (20)

1. A. Avron Gentzen-type systems, resolution and tableaux Journal of Automated Reasoning 10 2 1993 265 281
2. L. Bachmair, H. Ganzinger, Associative-commutative superposition, in: Proceedings of the 4th International Workshop on Conditional and Typed Rewriting, Springer, Jerusalem, 1994, pp. 1-14
3. L. Bachmair, and H. Ganzinger Non-clausal resolution and superposition with selection and redundancy criteria Logic programming and automated reasoning 1992 Springer Berlin 273 284
4. L. Bachmair, and H. Ganzinger Resolution theorem proving A. Robinson A. Voronkov Handbook of automated reasoning 2001 North Holland Amsterdan 19 100 (Chapter 2)
5. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder Basic paramodulation Information and Computation 121 2 1995 172 192
6. The CADE-18 ATP System Competition (CASC-18), 2002. Available from: 〈 http://www.cs.miami.edu/tptp/CASC/18/〉
7. A. Degtyarev, and A. Voronkov Stratified resolution Proceedings of the 17th International Conference on Automated Deduction (CADE-17) 2000 Springer Pittsburgh, PA, USA 365 384
8. G. Dowek, T. Hardin, C. Kirchner, Theorem proving modulo. Rapport de Recherche 3400, INRIA, 1998
9. H. Ganzinger, R. Nieuwenhuis, P. Nivela. The Saturate system, 1994. System available from: 〈 http://www.mpi-sb.mpg.de/SATURATE/〉
10. G. Huet, Design of a proof assistant. Invited Lecture at FLoC'96, 1996
11. Z. Manna, and R. Waldinger A deductive approach to program synthesis ACM Transactions on Programming Languages and Systems 2 1 1980 90 121
12. N.V. Murray Completely non-clausal theorem proving Artificial Intelligence 18 1 1982 67 85
13. R. Nieuwenhuis, and A. Rubio Paramodulation-based theorem proving A. Robinson A. Voronkov Handbook of automated reasoning 2001 North Holland Amsterdam 371 443 (Chapter 7)
14. R. Nieuwenhuis, and A. Rubio Theorem proving with ordering and equality constrained clauses Journal of Symbolic Computation 19 1995 321 351
15. A. Riazanov, and A. Voronkov The design and implementation of Vampire AI Communications 15 2-3 2002 91 110
16. S. Schulz, E-Setheo. Available from: 〈 http://www4.informatik.tu- muenchen.de/schulz/WORK/e-setheo.html〉
17. J. Stuber Deriving theory superposition calculi from convergent term rewriting systems Proceedings of the 11th International Conference on Rewriting Techniques and Applications (RTA 2000) 2000 Springer Norwich, UK 229 245
18. J. Stuber A model-based completeness proof of extended narrowing and resolution Proceedings of the First International Joint Conference on Automated Reasoning (IJCAR-2001) 2001 Siena Italy 195 210
19. G.S. Tseitin, On the complexity of derivation in propositional calculus, 1970.
20. Reprinted in: J. Siekmann, G. Wrightson (Eds.), Automation of Reasoning, vol. 2, Springer, Berlin, 1983, pp. 466-486