Paramodulation-Based Theorem Proving

Paramodulation-Based Theorem Proving (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Robert Nieuwenhuis , Albert Rubio

Citations:

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

927	A Machine-Oriented Logic Based on the Resolution Principle - Robinson - 1965
474	P.B.: Simple word problems in universal algebras - Knuth, Bendix - 1970
446	Termination of rewriting - Dershowitz - 1987
395	First-Order Logic and Automated Theorem Proving - Fitting - 1996
352	Confluent reductions: Abstract properties and applications to term rewriting systems - Huet - 1980
285	Mace4 Reference Manual and Guide - McCune
268	Relational queries computable in polynomial time - Immerman - 1986
257	Orderings for term rewriting systems - Dershowitz - 1982
221	Automafed Theorem Proving: A Logical Basis - Loveland - 1978
195	Rewrite-based equational theorem proving with selection and simplification - Bachmair, Ganzinger - 1994
165	Canonical forms and unification - Hullot - 1980
142	H.: Completion of a set of rules modulo a set of equations - Jouannaud, Kirchner - 1986
123	Solution of the Robbins Problem - McCune - 1997
112	Orderings for equational proofs - Bachmair, Dershowitz, et al. - 1986
105	Building-in equational theories - Plotkin - 1972
80	Termination of rewriting systems by polynomial interpretations and its implementation - Cherifa, Lescanne - 1987
72	Automated theorem-proving for theories with simplifiers, commutativity, and associativity. _. _C_ 21,4 - Slagle - 1974
70	Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio - 1995
69	Set constraints are the monadic class - Bachmair, Ganzinger, et al. - 1993
66	Basic paramodulation and superposition - Bachmair, Ganzinger, et al. - 1992
66	Basic paramodulation - Bachmair, Ganzingery, et al. - 1995
66	Deduction with symbolic constraints. Revue Francaise d’Intelligence - Kirchner, Kirchner, et al. - 1990
59	First-order unification in an equational theory - Fay - 1979
58	Automatic recognition of tractability in inference relations - McAllester - 1993
55	Onword problems in equational theories - Hsiang, Rusinowitch - 1987
54	Towards an automatic analysis of security protocols in first-order logic - Weidenbach - 1999
52	Proving theorems with the modification method - Brand
51	On restrictions of ordered paramodulation with simpli - Bachmair, Ganzinger - 1990
50	Solving symbolic ordering constraints - Comon - 1990
49	Termination orderings for associative-commutative rewrite systems - Bachmair, Plaisted - 1985
49	Conditional rewrite rules - Kaplan - 1984
48	Proof by consistency in equational theories - Bachmair - 1988
47	Two generalizations of the recursive path ordering. Unpublished note - Kamin, L'evy - 1980
47	Theorem proving with ordering constrained clauses - Nieuwenhuis, Rubio - 1992
45	Basic Superposition is Complete - Nieuwenhuis, Rubio - 1992
43	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	1991], Satisfiability of systems of ordinal notations with the subterm property is decidable - Jouannaud, Okada
36	Simple LPO constraint solving methods - Nieuwenhuis - 1993
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	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	The concept of demodulation in theorem proving - ROBINSON, CARSON, et al. - 1967
32	Automatically Proving Termination Where Simplification Orderings Fail - Arts, Giesl - 1997
32	Basic Narrowing Revisited - Nutt, R'ety, et al. - 1989
32	Equational reasoning in saturation-based theorem proving - Bachmair, Ganzinger - 1998
32	Shostak’s congruence closure as completion - Kapur
31	A technique for establishing completeness results in theorem proving with equality - Peterson - 1983
30	A completion procedure for conditional equations - Ganzinger - 1988