Combining Superposition, Sorts and Splitting

[1]  I. V. Ramakrishnan,et al.  Term Indexing , 1995, Lecture Notes in Computer Science.

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[4]  Christoph Weidenbach,et al.  On Generating Small Clause Normal Forms , 1998, CADE.

[5]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[6]  Christoph Meyer,et al.  Soft typing for clausal inference systems , 1999 .

[7]  Tanel Tammet.  Towards Efficient Subsumption , 1998, CADE.

[8]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[9]  Wayne Snyder,et al.  On the Complexity of Recursive Path Orderings , 1993, Inf. Process. Lett..

[10]  Larry Wos,et al.  Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[11]  Marcello D'Agostino,et al.  Are tableaux an improvement on truth-tables? , 1992, J. Log. Lang. Inf..

[12]  Gilles Dowek,et al.  Higher-Order Unification and Matching , 2001, Handbook of Automated Reasoning.

[13]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[14]  Andrei Voronkov,et al.  Splitting Without Backtracking , 2001, IJCAI.

[15]  Christoph Weidenbach,et al.  Soft Typing for Ordered Resolution , 1997, CADE.

[16]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[17]  Harald Ganzinger,et al.  Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality , 1993, Kurt Gödel Colloquium.

[18]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[19]  Robert Nieuwenhuis,et al.  Saturation of First-Order (Constrained) Clauses with the Saturate System , 1993, RTA.

[20]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[21]  Christoph Weidenbach,et al.  Unification in Extension of Shallow Equational Theories , 1998, RTA.

[22]  Christoph Weidenbach.  Sorted Unification and Tree Automata , 1998 .

[23]  Thomas Hillenbrand,et al.  System Description: Waldmeister - Improvements in Performance and Ease of Use , 1999, CADE.

[24]  Larry Wos,et al.  Experiments in Automated Deduction with Condensed Detachment , 1992, CADE.

[25]  Norbert Eisinger.  Completeness, confluence, and related properties of clause graph resolution , 1988 .

[26]  Christoph Weidenbach,et al.  Towards an Automatic Analysis of Security Protocols in First-Order Logic , 1999, CADE.

[27]  Stephan Schulz.  System Abstract: E 0.3 , 1999, CADE.

[28]  Robert Nieuwenhuis.  Basic Paramodulation and Decidable Theories (Extended Abstract) , 1996, LICS 1996.

[29]  Christoph Weidenbach.  System Description: Spass Version 1.0.0 , 1999, CADE.

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[32]  Rolf Socher.  A Subsumption Algorithm Based on Characteristic Matrices , 1988, CADE.

[33]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[34]  Georg Gottlob,et al.  On the efficiency of subsumption algorithms , 1985, JACM.

[35]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[36]  Georg Gottlob,et al.  Removing Redundancy from a Clause , 1993, Artif. Intell..

[37]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[38]  Reiner Hähnle,et al.  Tableaux and Related Methods , 2001, Handbook of Automated Reasoning.

[39]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[40]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[41]  Rona B. Stillman.  The Concept of Weak Substitution in Theorem-Proving , 1973, JACM.

[42]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[43]  Dan Benanav.  Simultaneous Paramodulation , 1990, CADE.

[44]  Bernd Fischer,et al.  Deduction-based software component retrieval , 2001, Ausgezeichnete Informatikdissertationen.

[45]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[46]  Andreas Podelski,et al.  The Horn mu-calculus , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[47]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logics , 1997 .

[48]  Robert Nieuwenhuis,et al.  Basic paramodulation and decidable theories , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[49]  Gerald E. Peterson,et al.  A Technique for Establishing Completeness Results in Theorem Proving with Equality , 1980, SIAM J. Comput..

[50]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[51]  Manfred Schmidt-Schauß.  Implication of Clauses is Undecidable , 1988, Theor. Comput. Sci..