MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Bachmair, Leo
Ganzinger, Harald		dblp
dblp
Editor(s):
Kaplan, St.
Okada, M.		dblp
dblp
BibTeX cite key*:
BachmairGanzinger-91-ctrs
Title, Booktitle
Title*:
Completion of first-order clauses with equality by strict superposition
Booktitle*:
Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Montreal, Canada
Language:
English
Event Date*
(no longer used):
1990
Organization:
Event Start Date:
1 May 2024
Event End Date:
1 May 2024
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
516
Number:
Month:
Pages:
162-180
Year*:
1991
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We have previously shown that strict superposition together with merging paramodulation is refutationally complete for first-order clauses with equality. This paper improves these results by considering a more powerful framework for simplification and elimination of clauses. The framework gives general criteria under which simplification and elimination do not destroy the refutation completeness of the superposition calculus. One application is a proof of the refutation completeness for alternative superposition strategies with arbitrary selection functions for negative literals. With these powerful simplification mechanisms it is often possible to compute the closure of nontrivial sets of clauses under superposition in a finite number of steps. Refutation or solving of {\em goals\/} for such closed or {\em complete\/} sets of clauses is simpler than for arbitrary sets of clauses. The results in this paper contain as special cases or generalize many known results about about ordered Knuth-Bendix-like completion of equations, of Horn clauses, of Horn clauses over built-in Booleans, about completion of first-order clauses by clausal rewriting, and inductive theorem proving for Horn clauses.
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:



BibTeX Entry:
@INPROCEEDINGS{BachmairGanzinger-91-ctrs,
AUTHOR = {Bachmair, Leo and Ganzinger, Harald},
 EDITOR = {Kaplan, St. and Okada, M.},
 TITLE = {Completion of first-order clauses with equality by strict superposition},
 BOOKTITLE = {Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting},
 PUBLISHER = {Springer},
 YEAR = {1991},
 VOLUME = {516},
 PAGES = {162--180},
 SERIES = {Lecture Notes in Computer Science},
 ADDRESS = {Montreal, Canada},
}

Entry last modified by Uwe Brahm, 08/06/2014
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]		Created
01/22/1995 02:33:07 PM
Revisions
7.
6.
5.
4.
3.		Editor(s)
Uwe Brahm
Uwe Brahm
Christine Kiesel/AG2/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE		Edit Dates
03/17/2001 11:13:06 AM
03/27/98 09:54:19 PM
30/01/96 13:54:10
16/02/95 18:24:07
15/02/95 16:09:50