Robert Nieuwenhuis, Albert Rubio  Home/Search
Context Related
| lsi.upc.es/~roberto/pa...handbook.ps.gz lsi.upc.es/~albert/pap...handbook.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsi.upc.es/~roberto/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This chapter of the Handbook of Automated Reasoning is about paramodulation theorem proving (Update)
Cited by: More
A Superposition View on Nelson-Oppen - Thomas Hillenbrand.. (Correct)
Uniform Derivation of Decision Procedures by Superposition - Armando, al. (2001) (Correct)
A Superposition Based Methodology to Design.. - Armando, Ranise.. (2001) (Correct)
Similar documents (at the sentence level):
12.8%: Data Structures and Algorithms for Automated Deduction with.. - Rivero (2000) (Correct)
6.6%: Constraints and Theorem Proving - Ganzinger, Nieuwenhuis (Correct)
Active bibliography (related documents): More All
1.4: Equational Reasoning In Saturation-Based Theorem Proving - Bachmair, Ganzinger (1998) (Correct)
1.3: Rewrite-based Deduction and Symbolic Constraints - Nieuwenhuis (1997) (Correct)
1.2: A Survey of Some Recent Trends in Rewrite-Based and.. - Nieuwenhuis (Correct)
Similar documents based on text: More All
0.9: Well-Foundedness is Sufficient for Completeness of Ordered.. - Bofill, Rubio (2002) (Correct)
0.6: Paramodulation with Built-in AC-Theories and Symbolic.. - Nieuwenhuis, Rubio (1996) (Correct)
0.6: Paramodulation and Knuth-Bendix Completion with.. - Bofill, Godoy.. (2001) (Correct)
Related documents from co-citation: More All
18: Rewrite-based equational theorem proving with selection and simplification (context) - Bachmair, Ganzinger - 1994
18: Theorem Proving with Ordering and Equality Constrained Clauses - Nieuwenhuis, Rubio - 1995
16: Rewrite systems - Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
Robert Nieuwenhuis and Albert Rubio. Paramodulation-based theorem proving. In J.A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers (to appear), 1999. http://citeseer.ist.psu.edu/nieuwenhuis01paramodulationbased.html More
@incollection{ nieuwenhuis01paramodulationbased,
author = "Robert Nieuwenhuis and Albert Rubio",
title = "Paramodulation-Based Theorem Proving",
booktitle = "Handbook of Automated Reasoning",
pages = "371-443",
year = "2001",
url = "citeseer.ist.psu.edu/nieuwenhuis01paramodulationbased.html" }
Citations (may not include all citations):634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
272 Argonne National Laboratory (context) - OTTER, Manual et al. - 1994
247 Confluent reductions: abstract properties and applications t.. (context) - Huet - 1980
245 Relational queries computable in polynomial time - Immerman - 1986
214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
186 Automated Theorem Proving: a Logical Basis (context) - Loveland - 1978
142 Rewrite-based equational theorem proving with selection and .. (context) - Bachmair, Ganzinger
114 Building in equational theories (context) - Plotkin - 1972
103 Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
82 Two generalizations of the recursive path ordering (context) - Kamin, Levy - 1980
76 Set constraints are the monadic class - Bachmair, Ganzinger et al.
74 Basic paramodulation and superposition (context) - Bachmair, Ganzinger et al. - 1992
67 Theorem Proving with Ordering and Equality Constrained Claus.. - Nieuwenhuis, Rubio - 1995
67 Paramodulation and theorem-proving in first order theories w.. (context) - Robinson, Wos - 1969
65 Automated theorem-proving for theories with simplifiers, com.. (context) - Slagle - 1974
62 Solution of the Robbins problem - McCune
59 On restrictions of ordered paramodulation with simplificatio.. (context) - Bachmair, Ganzinger - 1990
58 Canonical equational proofs (context) - Bachmair - 1991
58 Deduction with symbolic constraints (context) - Kirchner, Kirchner et al. - 1990
58 Termination of rewriting systems by polynomial interpretatio.. (context) - Ben-Cherifa, Lescanne - 1987
55 Theorem proving with ordering constrained clauses (context) - Nieuwenhuis, Rubio
55 Completion of a set of rules modulo a set of equations (context) - Kirchner - 1986
50 Automated Reasoning: 33 Basic Research Problems (context) - Wos - 1988
49 Orderings for equational proofs (context) - Bachmair, Dershowitz et al. - 1986
48 Basic narrowing revisited (context) - Nutt, R'ety et al. - 1989
47 Solving symbolic ordering constraints - Comon - 1990
46 Complete sets of transformations for general Eunification (context) - Gallier, Snyder - 1989
45 Proving refutational completeness of theorem proving strateg.. (context) - Hsiang, Rusinowitch - 1991
43 Termination orderings for associative-commutative rewriting .. (context) - Bachmair, Plaisted - 1985
43 Automatically proving termination where simplification order.. - Arts, Giesl - 1997
42 A superposition decision procedure for the guarded fragment .. - Ganzinger, de Nivelle - 1999
38 Simple LPO constraint solving methods - Nieuwenhuis - 1993
34 Any ground associative commutative theory has a finite canon.. - Narendran, Rusinowitch - 1991
34 The two-variable guarded fragment with transitive relations - Ganzinger, Meyer et al. - 1999
34 A technique for establishing completeness results in theorem.. (context) - Peterson - 1983
33 Completion for rewriting modulo a congruence (context) - Bachmair, Dershowitz - 1989
33 A completion procedure for conditional equations (context) - Ganzinger - 1991
31 Associative Commutative Deduction with constraints - Vigneron - 1994
29 Decision procedures for simple equational theories with comm.. (context) - Lankford, Ballantyne - 1977
25 AC-Superposition with constraints: No AC-unifiers needed - Nieuwenhuis, Rubio - 1994
23 Satisfiability of systems of ordinal notations with the subt.. (context) - Okada - 1991
23 The concept of demodulation in theorem proving (context) - Wos, Robinson et al. - 1967
22 Complete sets of reductions with constraints (context) - Peterson - 1990
21 Double exponential complexity of computing complete sets of .. - Kapur, Narendran - 1992
21 Automated deduction with associative commutative operators - Rusinowitch, Vigneron - 1995
21 Ordered rewriting and confluence (context) - Martin, Nipkow - 1990
20 A total AC-compatible ordering based on RPO - Rubio, Nieuwenhuis - 1995
19 Complexity Analysis Based on Ordered Resolution - Basin, Ganzinger - 1996
19 the recursive decomposition ordering with lexicographical st.. (context) - On - 1990
18 A new method for proving termination of acrewrite systems (context) - Kapur, Sivakumar et al. - 1990
18 Decision problems in ordered rewriting - Comon, Narendran et al. - 1998
18 The Automation of Reasoning: An Experimenter's Notebook with.. (context) - Wos - 1996
18 First-order theorem proving modulo equations (context) - Wertz - 1992
17 Using Forcing to Prove Completeness of Resolution and Paramo.. (context) - Pais, Peterson - 1991
17 NARROWER: a new algorithm for unification and its applicatio.. (context) - Rety, Kirchner et al. - 1985
17 Superposition with simplification as a decision procedure fo.. (context) - Bachmair, Ganzinger et al.
16 Basic paramodulation - Bachmair, Ganzinger et al. - 1995
15 On word problems in Horn theories (context) - Kounalis, Rusinowitch - 1991
15 Theorem proving in cancellative abelian monoids - Ganzinger, Waldmann - 1996
15 Ordering Constraints on Trees - Comon, Treinen - 1994
14 Paramodulationwith Built-in AC-Theories and Symbolic Constra.. - Nieuwenhuis, Rubio - 1997
14 Superposition theorem proving for abelian groups represented.. - Stuber
13 Conditional rewrite rules (context) - Kaplan - 1984
13 Associative-commutative superposition - Bachmair, Ganzinger
13 An optimal narrowing strategy for general canonical systems (context) - Bockmayr, Krischer et al. - 1992
12 Practical results on the saturation of full first-order clau.. (context) - Nivela, Nieuwenhuis - 1993
12 Decidability and complexity analysis by basic paramodulation - Nieuwenhuis - 1998
12 Reductive conditional term rewriting systems (context) - Waldmann - 1986
12 The CADE-14 ATP system competition - Sutcliffe, Suttner - 1998
12 The Saturate System - Ganzinger, Nieuwenhuis et al. - 1999
11 ground path ordering for proving termination of ac-rewrite s.. (context) - Kapur, Sivakumar - 1997
11 A fully syntactic AC-RPO - Rubio - 1999
10 Extension Orderings - Rubio - 1995
10 Refutation Proofs and Constraints (context) - On - 1995
10 Paramodulation with nonmonotonic orderings - Bofill, Godoy et al. - 1999
10 Redundancy criteria for constrained completion - Lynch, Snyder - 1993
9 Clausal rewriting (context) - Nieuwenhuis, Orejas - 1990
9 AC-Theories and Symbolic Constraint Solving (context) - Comon, Nieuwenhuis et al. - 1995
9 Oriented equational logic programming is complete - Lynch - 1997
9 Goal directed strategies for paramodulation (context) - Snyder, Lynch - 1991
8 LSE narrowing for decreasing conditional term rewrite system.. (context) - Bockmayr, Werner - 1994
8 Automated deduction with ordering and equality constrained c.. (context) - Rubio - 1994
8 Superposition for divisible torsion-free abelian monoids (context) - Waldmann - 1998
7 and Induction: Automated Reasoning in an Equational Logic (context) - Reduction - 1988
7 Solved forms for path ordering constraints - Nieuwenhuis, Rivero - 1999
7 A general refutational completeness result for an inference .. (context) - Paul - 1992
7 RPO constraint solving is in NP - Narendran, Rusinowitch et al. - 1998
7 Unification in extensions of shallow equational theories - Jacquemard, Meyer et al. - 1998
7 Proving termnation with multiset orderings (context) - Dershowitz, Manna - 1979
6 Skolem functions and equality in automated deduction (context) - McCune - 1990
6 Positive deduction modulo regular theories - Vigneron - 1996
6 Theorem proving modulo associativity - Rubio - 1996
5 the declarative semantics of deductive databases and logic p.. (context) - On - 1988
5 Superposition theorem proving for commutative rings (context) - Stuber
5 Cancellative superposition decides the theory of divisible t.. - Waldmann - 1999
5 Paramodulation with built-in abelian groups - Godoy, Nieuwenhuis - 2000
4 The Unifiability Problem in Ground AC Theories (context) - Narendran, Rusinowitch - 1993
4 Basic completion with E-cycle simplification - Lynch, Scharff - 1998
4 of Mathematics and Computer Science (context) - Canonical, Technical et al. - 1975
3 Completion Whitout Failure (context) - Bachmair, Dershowitz et al. - 1989
3 Termination and completion modulo associativity, commutativi.. - March'e - 1992
3 Syntacticness, Cycle-Syntacticness and Shallow Theories - Comon, Haberstrau et al. - 1994
3 Confluent and coherent equational term rewriting systems: Ap.. (context) - Jouannaud - 1983
3 Well behaved search and the Robbins problem - McCune
3 Proof normalization for resolution and paramodulation (context) - Bachmair - 1989
2 Compilation de Formes Canoniques dans les Teories Equationne.. (context) - Hullot
2 Efficient deduction in equality horn logic by horncompletion (context) - Nieuwenhuis, Nivela - 1991
2 The monotonic paramodulation strategy (context) - Degtyarev - 1979
1 Perfect model semantics for logic programs with equality (context) - proving, Ganzinger - 1991
1 Equality methods in machine theorem proving (context) - Degtyarev, Voronkov - 1986
1 Canonical forms and unification (context) - proving
1 Induction = I-axiomatization + first-order consistency - Comon, Nieuwenhuis - 2000
1 Narrowing vs. sld-resolution (context) - Bosco, Giovanetti et al. - 1988
1 Basic superposition is complete (context) - proving, Rubio
1 A path ordering for proving terminationfor term rewriting sy.. (context) - Kapur, Narendran et al. - 1985
1 Weakly Stratified Logic Programs (context) - Przymusi'nska, Przymusi'nski - 1990
1 The complexity of relational query languages (context) - http, cs et al. - 1982
1 Equational inference, canonical proofs, and proof orderings - Bachmair, Dershowitz - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lsi.upc.es/~roberto/papers.html): More
Induction = I-Axiomatization + First-Order Consistency - Comon, Nieuwenhuis (1999) (Correct)
Paramodulation with Non-Monotonic Orderings - Bofill, Godoy, Nieuwenhuis, Rubio (1999) (Correct)
Modular Redundancy for Theorem Proving - Bofill, Godoy, Nieuwenhuis, Rubio (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC