Resolution Theorem Proving

Resolution Theorem Proving (2001)

Cached

Download Links

by Leo Bachmair , Harald Ganzinger

Citations:

BibTeX

@MISC{Bachmair01resolutiontheorem,
    author = {Leo Bachmair and Harald Ganzinger},
    title = { Resolution Theorem Proving},
    year = {2001}
}

Bookmark

OpenURL

Abstract

Citations

926	A computing procedure for quantification theory - Davis, Putnam - 1960
829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
792	Symbolic boolean manipulation with ordered binary decision diagrams - Bryant - 1992
641	Predicate logic as a programming language - Kowalski - 1974
636	A machine program for theorem proving - Davis, Logemann, et al. - 1962
431	Associative-commutative rewriting - Dershowitz, Hsiang, et al. - 1983
157	A Structure-preserving Clause Form Translation - Plaisted, Greenbaum - 1986
136	Logic for Computer Science: Foundations of Automatic Theorem - Gallier - 1986
127	A deductive approach to program synthesis - Manna, Waldinger - 1980
90	Linear resolution with selection function - Kowaiski, Kuehner - 1971
79	C.: Computing small clause normal forms - Nonnengart, Weidenbach - 2001
66	Deduction with symbolic constraints. Revue Francaise d’Intelligence - Kirchner, Kirchner, et al. - 1990
57	A computing procedure for quanti theory - Davis, Putnam - 1960
53	Automatic recognition of tractability in inference relations - McAllester - 1993
51	On restrictions of ordered paramodulation with simpli - Bachmair, Ganzinger - 1990
50	Refutational theorem proving using term-rewriting systems - Hsiang - 1985
48	Proving theorems with the modification method - Brand - 1975
47	Theorem proving with ordering constrained clauses - Nieuwenhuis, Rubio - 1992
45	Resolution methods for decision problems - Fermüller, Leitsch, et al. - 1993
38	Automated complexity analysis based on ordered resolution - Basin, Ganzinger
37	Resolution decision procedure - Fermüller, Leitsch, et al. - 2001
36	Rewrite techniques for transitive relations - Bachmair, Ganzinger - 1993
33	Constrained Resolution: A Complete Method for Higher Order Logic - Huet - 1972
33	Superposition with simplification as a decision procedure for the monadic class with equality - Bachmair, Ganzinger, et al. - 1993
29	AC-supperposition with constraints: No ACunifiers needed - Nieuwenhuis, Rubio - 1990
27	Gentzen-Type Systems, Resolution and Tableaux - Avron - 1993
26	The inverse method of establishing deducibility in classical predicate calculus - Maslov - 1964
26	A Resolution Principle for Clauses with Constraints - Bürckert - 1990
25	Locking: A Restriction of Resolution - Boyer - 1971
23	A simplified format for the model elimination theorem-proving procedure - Loveland - 1969
21	Completely Non-Clausal Theorem Proving - Murray - 1982
18	An ordered theory resolution calculus - Baumgartner
15	A proof method for quantification theory - Gilmore - 1960
13	Resolution is a decision procedure for many propositional modal logics - Schmidt - 1998
12	Ordered paramodulation and resolution as decision procedure - Fermüller, Salzer - 1993
11	Using forcing to prove completeness of resolution and paramodulation - Pais, Peterson - 1995
10	Paramodulation-based theorem proving. In Robinson and Voronkov [26], pages 371–443. Adam Pease and Christoph Benzmüller. Sigma: An integrated development environment for formal ontology - Nieuwenhuis, Rubio - 2012
9	What is the inverse method - Lifschitz - 1989
8	Superposition with simpli as a decision procedure for the monadic class with equality - Bachmair, Ganzinger, et al. - 1993
7	Ordering Refinements of Resolution - Nivelle - 1995
5	Proving theorems with the modi method - Brand - 1975
5	2001], Normal form transformations - Baaz, Egly, et al.
4	Oriented equational logic is complete - Lynch - 1997
4	On the complexity of derivation in propositional calculus. Seminars in Mathematics - Tseitin - 1968
3	1996], Ordering Re of Resolution - Nivelle - 1995
3	Building-in equational theories', Machine Intelligence 7. Reynolds J. C. [1965], Unpublished seminar notes - Plotkin
2	1999], Resolution-Based Decisison Procedures for Subclasses of First-Order Logic - Hustadt
2	An equational approach to theorem proving in predicate calculus - Kapur, Narendran
2	Reduction Techniques for First-Order Reasoning - Bronsard, Reddy - 1992
1	1987], Critical pair criteria for rewriting modulo a congruence - Bachmair, Dershowitz