Paramodulation-Based Theorem Proving

Paramodulation-Based Theorem Proving (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Nieuwenhuis , Albert Rubio

Citations:

111 - 7 self

BibTeX

@MISC{Nieuwenhuis99paramodulation-basedtheorem,
    author = {Robert Nieuwenhuis and Albert Rubio},
    title = {Paramodulation-Based Theorem Proving},
    year = {1999}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

939	A machine-oriented logic based on the resolution principle - Robinson - 1965
490	Simple word problems in universal algebras - Knuth, Bendix - 1970
453	Termination of rewriting - Dershowitz - 1985
408	First-Order Logic and Automated Theorem Proving. 2nd edn - Fitting - 1996
364	Confluent reductions: Abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems - Huet - 1980
292	Otter 3.0 Reference Manual and Guide - McCune - 1994
269	Relational queries computable in polynomial time - Immerman - 1986
264	Orderings for term-rewriting systems - Dershowitz - 1979
222	Automated Theorem Proving : A Logical Basis - Loveland - 1978
197	Rewrite-based equational theorem proving with selection and simplification - Bachmair, Ganzinger - 1994
166	Canonical forms and unification - Hullot - 1980
145	Completion of a set of rules modulo a set of equations - Jouannaud, Kirchner - 1986
129	Solution of the robbins problem - Mccune - 1997
116	Orderings for equational proofs - Bachmair, Dershowitz, et al. - 1986
109	Building-in equational theories - Plotkin - 1972
80	Termination of rewriting systems by polynomial interpretations and its implementation - Cherifa, Lescanne - 1987
73	Theorem proving with ordering and equality constrained clauses - Nieuwenhuis, Rubio - 1995
72	Automated theorem-proving for theories with simplifiers, commutativity, and associativity - Slagle - 1974
69	Set constraints are the monadic class - Bachmair, Ganzinger, et al. - 1993
67	Basic paramodulation - Bachmair, Ganzinger, et al. - 1995
66	Deduction with symbolic constraints. Revue Francaise d'Intelligence Artificielle, 4(3):9--52 - Kirchner, Kirchner, et al. - 1990
65	Basic paramodulation and superposition - Bachmair, Ganzinger, et al. - 1992
62	Towards an automatic analysis of security protocols in first-order logic - Weidenbach - 1999
61	First-order unification in an equational theory - Fay - 1979
61	Automatic recognition of tractability in inference relations - McAllester - 1993
58	On word problems in equational theories - Hsiang, Rusinowitch - 1987
52	On restrictions of ordered paramodulation with simplification - Bachmair, Ganzinger - 1990
52	Proving theorems with the modification method - Brand - 1975
50	Solving symbolic ordering constraints - Comon - 1990
50	Conditional rewrite rules - Kaplan - 1984
49	Termination orderings for associative-commutative rewrite systems - Bachmair, Plaisted - 1985
49	Proof by consistency in equational theories - Bachmair - 1988
48	Two generalizations of the recursive path ordering. Unpublished - Kamin, Levy - 1980
47	Theorem proving with ordering constrained clauses - Nieuwenhuis, Rubio - 1992
46	Basic superposition is complete - Nieuwenhuis, Rubio - 1992
44	Complexity analysis based on ordered resolution - Basin, Ganzinger - 1996
38	M.: Proving Refutational Completeness of Theorem Proving Strategies: The Transfinite Semantic Tree Method - Hsiang, Rusinowitch - 1991
37	Rewrite techniques for transitive relations - Bachmair, Ganzinger - 1994
36	Satisfiability of systems of ordinal notations with the subterm property is decidable - Jouannaud, Okada - 1991
36	Simple LPO constraint solving methods - Nieuwenhuis - 1993
36	The concept of demodulation in theorem proving - wos, Robinson, et al. - 1967
36	Linear-time algorithms for testing the satis of propositional horn formulae - Dowling, Gallier - 1984
35	Superposition with Simplification as a Decision Procedure for the Monadic Class with Equality - Bachmair, Ganzinger, et al. - 1993
34	The two-variable guarded fragment with transitive relations - Ganzinger, Meyer, et al. - 1999
34	Equational Reasoning in Saturation-Based Theorem Proving - Bachmair, Ganzinger - 1998
32	Automatically Proving Termination Where Simplification Orderings Fail - Arts, Giesl - 1997
32	A completion procedure for conditional equations - Ganzinger - 1991
32	Basic Narrowing Revisited - Nutt, R'ety, et al. - 1989
32	A technique for establishing completeness results in theorem proving with equality - Peterson - 1983
32	Shostak’s congruence closure as completion - Kapur