Paramodulation-Based Theorem Proving

Paramodulation-Based Theorem Proving (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Nieuwenhuis , Albert Rubio

Citations:

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

829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
448	Simple Word Problems in Universal Algebra - Knuth, Bendix - 1970
431	Associative-commutative rewriting - Dershowitz, Hsiang, et al. - 1983
376	First-order Logic and Automated Theorem Proving (2nd ed - Fitting - 1996
340	Confluent reductions: Abstract properties and applications to term rewriting systems - Huet - 1980
254	Relational queries computable in polynomial time - Immerman - 1986
254	Otter 3.0 Reference Manual and Guide - McCune - 1994
253	Orderings for term-rewriting systems - Dershowitz - 1982
211	Automated Theorem Proving: A Logical Basis - Loveland - 1987
184	H.: Rewrite-based equational theorem proving with selection and simplification - Bachmair, Ganzinger - 1994
162	Canonical forms and unification - Hullot - 1980
138	Termination of a set of rules modulo a set of equations - Jouannaud, Mufioz - 1984
113	Solution to the Robbins problem - McCune - 1997
110	Canonical Equational Proofs - Bachmair - 1991
105	Building-in equational theories - Plotkin - 1972
79	Termination of rewriting systems by polynomial interpretations and its implementation - Cherifa, Lescanne
69	Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio - 1995
69	Automated theorem-proving for theories with simplifiers, commutativity - Slagle - 1974
68	Set constraints are the monadic class - Bachmair, Ganzinger, et al. - 1993
66	Deduction with symbolic constraints. Revue Francaise d’Intelligence - Kirchner, Kirchner, et al. - 1990
64	Basic paramodulation and superposition - Bachmair, Ganzinger, et al. - 1992
64	W.: Basic paramodulation - Bachmair, Ganzinger, et al. - 1995
58	First-Order Unification in an Equational Theory - Fay - 1979
55	On word problems in equational theories - Hsiang, Rusinowitch - 1987
53	Towards an automatic analysis of security protocols - Weidenbach - 1999
53	Automatic recognition of tractability in inference relations - McAllester - 1993
51	On restrictions of ordered paramodulation with simpli - Bachmair, Ganzinger - 1990
49	D.A.: Termination Orderings for Associative-Commutative Rewriting Systems - Bachmair, Plaisted - 1985
48	Proving theorems with the modification method - Brand - 1975
48	Solving symbolic ordering constraints - Comon - 1990
48	Proof by consistency in equational theories - Bachmair - 1988
47	Two generalizations of the recursive path ordering. Unpublished note - Kamin, Lévy - 1980
47	Conditional rewrite rules - Kaplan - 1984
47	Theorem proving with ordering constrained clauses - Nieuwenhuis, Rubio - 1992
45	Basic Superposition is Complete - Nieuwenhuis, Rubio - 1992
38	Automated complexity analysis based on ordered resolution - Basin, Ganzinger
37	Proving refutational completeness of theorem proving strategies: The transnite semantic tree method - Hsiang, Rusinowitch - 1991
36	Rewrite techniques for transitive relations - Bachmair, Ganzinger - 1993
36	Linear-time algorithms for testing the satis of propositional horn formulae - Dowling, Gallier - 1984
35	Satisfiability of systems of ordinal notations with the subterm ordering is decidable - Jouannaud, Okada - 1991
35	Simple LPO constraint solving methods - Nieuwenhuis
33	Superposition with simplification as a decision procedure for the monadic class with equality - Bachmair, Ganzinger, et al. - 1993
33	The two-variable guarded fragment with transitive relations - Meyer, Veanes - 1999
32	Basic Narrowing Revisited - Nutt, R'ety, et al. - 1989
31	Automatically Proving Termination Where Simplification Orderings Fail - Arts, Giesl - 1997
31	The concept of demodulation in theorem proving - Wos, Robinson, et al. - 1967
30	A Completion Procedure for Conditional Equations - Ganzinger - 1991
30	A technique for establishing completeness results in theorem proving with equality - Peterson - 1983
30	Equational reasoning in saturation-based theorem proving - Bachmair, Ganzinger - 1998
30	Shostak’s Congruence Closure as Completion, in: H - Kapur - 1997