Resolution Theorem Proving

[1]  Jean Goubault-Larrecq,et al.  Normal Form Transformations , 2001, Handbook of Automated Reasoning.

[2]  Christian G. Fermüller,et al.  Resolution Decision Procedures , 2001, Handbook of Automated Reasoning.

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

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

[5]  Ullrich Hustadt.  Resolution based decision procedures for subclasses of first-order logic , 1999 .

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

[7]  Christopher Lynch,et al.  Oriented Equational Logic Programming is Complete , 1995, J. Symb. Comput..

[8]  Harald Ganzinger,et al.  Complexity analysis based on ordered resolution , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[9]  Renate A. Schmidt,et al.  Resolution is a Decision Procedure for Many Propositional Modal Logics , 1996, Advances in Modal Logic.

[10]  J.M.G.G. de Nivelle.  Ordering Refinements of Resolution , 1995 .

[11]  Harald Ganzinger,et al.  Rewrite techniques for transitive relations , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[12]  Laurent Vigneron,et al.  Associative-Commutative Deduction with Constraints , 1994, CADE.

[13]  Reiner Hähnle,et al.  Semantic Tableaux with Ordering Restrictions , 1994, CADE.

[14]  Albert Rubio,et al.  AC-Superposition with Constraints: No AC-Unifiers Needed , 1994, CADE.

[15]  Hantao Zhang.  A New Method for the Boolean Ring Based Theorem Proving , 1994, J. Symb. Comput..

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

[17]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[18]  Christian G. Fermüller,et al.  Ordered Paramodulation and Resolution as Decision Procedure , 1993, LPAR.

[19]  David A. McAllester.  Automatic recognition of tractability in inference relations , 1993, JACM.

[20]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[21]  Peter Baumgartner.  An Order Theory Resolution Calculus , 1992, LPAR.

[22]  Uday S. Reddy,et al.  Reduction Techniques for First-Order Reasoning , 1992, CTRS.

[23]  Albert Rubio,et al.  Theorem Proving with Ordering Constrained Clauses , 1992, CADE.

[24]  Gerald E. Peterson,et al.  Using Forcing to Prove Completeness of Resolution and Paramodulation , 1991, J. Symb. Comput..

[25]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

[26]  Hans-Jürgen Bürckert,et al.  A Resolution Principle for Clauses with Constraints , 1990, CADE.

[27]  C. Kirchner,et al.  Deduction with symbolic constraints , 1990 .

[28]  Larry Wos,et al.  Automated reasoning - 33 basic research problems , 1988 .

[29]  D. Kapur,et al.  Reduction, superposition and induction: automated reasoning in an equational logic , 1988 .

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

[31]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[32]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[33]  D. Kapur,et al.  An equational approach to theorem proving in first-order predicate calculus , 1985, SOEN.

[34]  Jieh Hsiang,et al.  Refutational Theorem Proving Using Term-Rewriting Systems , 1985, Artif. Intell..

[35]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[36]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[37]  Neil V. Murray.  Completely Non-Clausal Theorem Proving , 1982, Artif. Intell..

[38]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

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

[40]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[41]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[42]  Gérard Huet,et al.  Constrained resolution: a complete method for higher-order logic. , 1972 .

[43]  Robert A. Kowalski,et al.  Linear Resolution with Selection Function , 1971, Artif. Intell..

[44]  Donald W. Loveland,et al.  A Simplified Format for the Model Elimination Theorem-Proving Procedure , 1969, J. ACM.

[45]  James R. Slagle,et al.  Automatic Theorem Proving With Renamable and Semantic Resolution , 1967, JACM.

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

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

[48]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[49]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[50]  Paul C. Gilmore,et al.  A Proof Method for Quantification Theory: Its Justification and Realization , 1960, IBM J. Res. Dev..