Miquel Bofill, Albert Rubio  Home/Search
Context Related
| ima.udg.es/~mbofill/cade02long.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: ima.udg.es/~mbofill/indexUK (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For many years all known completeness results for Knuth-Bendix completion and ordered paramodulation required the term ordering to be well-founded, monotonic and total(izable) on ground terms. (Update)
Similar documents based on text: More All
3.8: Well-Foundedness is Sufficient for Completeness of Ordered.. - Bofill, Rubio (2002) (Correct)
2.0: Paramodulation and Knuth-Bendix Completion with.. - Bofill, Godoy.. (2001) (Correct)
2.0: Paramodulation with Non-Monotonic Orderings - Bofill, Godoy, Nieuwenhuis, Rubio (1999) (Correct)
BibTeX entry: (Update)
Miquel Bofill and Albert Rubio. Well-foundedness is sufficient for completeness of Ordered Paramodulation. Long version, 2002. Available at www.lsi.upc.es/~albert/papers.html. http://citeseer.ist.psu.edu/bofill02wellfoundedness.html More
@misc{ bofill02wellfoundedness,
author = "M. Bofill and A. Rubio",
title = "Well-foundedness is sufficient for completeness of Ordered Paramodulation",
text = "Miquel Bofill and Albert Rubio. Well-foundedness is sufficient for completeness
of Ordered Paramodulation. Long version, 2002. Available at www.lsi.upc.es/~albert/papers.html.",
year = "2002",
url = "citeseer.ist.psu.edu/bofill02wellfoundedness.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
142 Rewrite-based equational theorem proving with selection and .. (context) - Bachmair, Ganzinger - 1994
67 Theorem Proving with Ordering and Equality Constrained Claus.. - Nieuwenhuis, Rubio - 1995
51 Information and Computation (context) - Bachmair, Ganzinger et al. - 1995
49 Orderings for equational proofs (context) - Bachmair, Dershowitz et al. - 1986
45 Proving refutational completeness of theorem proving strateg.. (context) - Hsiang, Rusinowitch - 1991
37 Paramodulation-based theorem proving - Nieuwenhuis, Rubio - 2001
24 Equational reasoning in saturationbased theorem proving - Bachmair, Ganzinger - 1998
19 volume 25 of EATCS Monographs on Theoretical Computer Scienc.. (context) - Wechler, for - 1991
18 the Association for Computing Machinery (context) - Bachmair, Dershowitz et al. - 1994
10 Paramodulation with non-monotonic orderings - ll, Godoy et al. - 1999
1 Well-foundedness is su- cient for completeness of Ordered Pa.. (context) - ll, Rubio - 2002
Documents on the same site (http://ima.udg.es/~mbofill/indexUK.html):
On the Completeness of Arbitrary Selection Strategies for.. - Bofill, Godoy (Correct)
On the Completeness of Arbitrary Selection Strategies for.. - Bofill, Godoy (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