Paramodulation-Based Theorem Proving

Paramodulation-Based Theorem Proving (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Nieuwenhuis , Albert Rubio

Citations:

117 - 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

972	A machine-oriented logic based on the resolution principle - Robinson - 1965
509	Simple word problems in universal algebra - Knuth, Bendix - 1970
466	Termination of rewriting - Dershowitz - 1987
428	First-Order Logic and Automated Theorem Proving - Fitting - 1996
375	Confluent reductions: Abstract properties and applications to term rewriting systems - Huet - 1980
308	Mace4 reference manual and guide - McCune
274	Relational queries computable in polynomial time - Immerman - 1986
268	Orderings for term rewriting systems - Dershowitz - 1982
228	Automated Theorem Proving: A Logical Basis - Loveland - 1978
202	Rewrite-based equational theorem proving with selection and simplification - Bachmair, Ganzinger - 1994
169	Canonical Forms and Unification - Hullot - 1980
151	Completion of a set of rules modulo a set of equations - Jouannaud, Kirchner - 1986
132	Solution of the Robbins Problem - McCune - 1997
118	Canonical Equational Proofs - Bachmair - 1991
116	Building in equational theories - Plotkin - 1972
82	Termination of Rewriting Systems by Polynomial Interpretations and its Implementation, Science of Computer Programming 9(2 - Cherifa, Lescanne - 1987
76	Automated theorem-proving for theories with simplifiers, commutativity and associativity - Slagle - 1974
73	Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio - 1995
72	Set constraints are the monadic class - Bachmair, Ganzinger, et al. - 1993
67	Basic Paramodulation - Bachmair, Ganzinger, et al. - 1995
67	Deduction with symbolic constraints', Revue Francaise d'Intelligence Artificielle 4(3 - Kirchner, Kirchner, et al. - 1990
65	First-Order Unification in an Equational Theory - Fay - 1979
64	Basic paramodulation and superposition - Bachmair, Ganzinger, et al. - 1992
64	Towards an automatic analysis of security protocols in first-order logic - Weidenbach - 1999
63	Automatic recognition of tractability in inference relations - McAllester - 1990
59	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
50	Termination orderings for associative-commutative rewriting sys tems - Bachmair, Plaisted - 1985
50	Solving symbolic ordering constraints - Comon
50	Conditional rewrite rules - Kaplan - 1984
49	Two generalizations of the recursive path ordering, Unpublished note - Kamin, Levy - 1980
49	Proof by consistency in equational theories - Bachmair - 1988
46	1992], Theorem proving with ordering constrained clauses - Nieuwenhuis, Rubio
45	Automated complexity analysis based on ordered resolution - Basin, Ganzinger - 2001
45	Basic superposition is complete - Nieuwenhuis, Rubio - 1992
38	Proving refutational completeness of theorem proving strategies: The transfinite semantic tree method - Hsiang, Rusinowitch - 1991
37	Superposition with simplification as a decision procedure for the monadic class with equality - Bachmair, Ganzinger, et al. - 1993
37	The concept of demodulation in theorem proving - Wos, Robinson, et al. - 1967
37	Rewrite techniques for transitive relations - Bachmair, Ganzinger - 1994
36	Linear-time algorithms for testing the satis of propositional horn formulae - Dowling, Gallier - 1984
35	A completion procedure for conditional equations - Ganzinger - 1987
35	The two-variable guarded fragment with transitive relations - Ganzinger, Meyer, et al. - 1999
35	Satisfiability of systems of ordinal notations with the subterm property is decidable - Jouannaud, Okada - 1991
35	Simple LPO constraint solving methods - Nieuwenhuis - 1993
34	Equational Reasoning in Saturation-Based Theorem Proving - Bachmair, Ganzinger - 1998
34	Shostak’s congruence closure as completion - Kapur - 1997
33	Automatically proving termination where simplification orderings fail - Arts - 1997
32	Basic Narrowing Revisited - Nutt, R'ety, et al. - 1989
32	A technique for establishing completeness results in theorem proving with equality - Peterson - 1983