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)
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)
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
[Article contains additional citations not shown here]
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