Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Bachmair, Leo
Ganzinger, Harald

dblp
dblp



Editor(s):

Voronkov, A.

dblp



BibTeX cite key*:

BachmairGanzinger-92-lpar

Title, Booktitle

Title*:

Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria

Booktitle*:

Logic Programming and Automated Reasoning

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

St.\ Petersburg, Russia

Language:

English

Event Date*
(no longer used):

1992

Organization:


Event Start Date:

17 July 2019

Event End Date:

17 July 2019

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

624

Number:


Month:

July

Pages:

273-284

Year*:

1992

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We extend previous results about resolution and superposition with ordering constraints and selection functions to the case of general (quantifier-free) first-order formulas with equality. The refutation completeness of our calculi is compatible with a general and powerful redundancy criterion which includes most (if not all) techniques for simplifying and deleting formulas. The spectrum of first-order theorem proving techniques covered by our results includes ordered resolution, positive resolution, hyper-resolution, semantic resolution, set-of-support resolution, and Knuth/Bendix completion, as well as their extension to general first-order formulas. An additional feature in the latter case is our efficient handling of equivalences as equalities on the level of formulas. Furthermore, our approach applies to constraint theorem proving, including constrained resolution and theory resolution.



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-92-lpar,
AUTHOR = {Bachmair, Leo and Ganzinger, Harald},
EDITOR = {Voronkov, A.},
TITLE = {Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria},
BOOKTITLE = {Logic Programming and Automated Reasoning},
PUBLISHER = {Springer},
YEAR = {1992},
VOLUME = {624},
PAGES = {273--284},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {St.\ Petersburg, Russia},
MONTH = {July},
}


Entry last modified by Uwe Brahm, 08/25/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
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:10 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Uwe Brahm
Christine Kiesel/AG2/MPII/DE
Uwe Brahm/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Edit Dates
03/27/98 09:54:08 PM
30/01/96 13:23:26
16/02/95 18:22:49
15/02/95 16:17:13
10/02/95 17:54:22