Journal Article
@Article
Artikel in Fachzeitschrift

Show entries of:

this year (2024) | last year (2023) | two years ago (2022) | Notes URL

Action:

login to update
Options:








Author, Editor(s)
Author(s):
Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe		dblp
dblp
dblp

BibTeX cite key*:

BachmairGanzingerWaldmann-94-aaecc

Title

Title*:

Refutational Theorem Proving for Hierarchic First-Order Theories

Journal

Journal Title*:

Applicable Algebra in Engineering, Communication and Computing (AAECC)
Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

Springer
Publisher's URL:


Publisher's
Address:

Berlin, Germany
ISSN:

0938-1287

Vol, No, pp, Date

Volume*:

5
Number:

3/4

Publishing Date:

April 1994

Pages*:

193-212
Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:

Earlier Version: Theorem Proving for Hierarchic First-Order Theories, in Giorgio Levi and H{\'e}l{\`e}ne Kirchner, editors, {\em Algebraic and Logic Programming, Third International Conference}, LNCS 632, pages 420--434, Volterra, Italy, September 2--4, 1992, Springer-Verlag

(LaTeX) Abstract:

We extend previous results on theorem proving for first-order clauses with equality to hierarchic first-order theories. Semantically such theories are confined to conservative extensions of the base models. It is shown that superposition together with variable abstraction and constraint refutation is refutationally complete for theories that are sufficiently complete with respect to simple instances. For the proof we introduce a concept of approximation between theorem proving systems, which makes it possible to reduce the problem to the known case of (flat) first-order theories. These results allow the modular combination of a superposition-based theorem prover with an arbitrary refutational prover for the primitive base theory, whose axiomatic representation in some logic may remain hidden. Furthermore they can be used to eliminate existentially quantified predicate symbols from certain second-order formulae.

URL for the Abstract:


Categories,
Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


Download
Access Level:


Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography


BibTeX Entry:
@ARTICLE{BachmairGanzingerWaldmann-94-aaecc,
AUTHOR = {Bachmair, Leo and Ganzinger, Harald and Waldmann, Uwe},
 TITLE = {Refutational Theorem Proving for Hierarchic First-Order Theories},
 JOURNAL = {Applicable Algebra in Engineering, Communication and Computing (AAECC)},
 PUBLISHER = {Springer},
 YEAR = {1994},
 NUMBER = {3/4},
 VOLUME = {5},
 PAGES = {193--212},
 ADDRESS = {Berlin, Germany},
 MONTH = {April},
 ISBN = {0938-1287},
 NOTE = {Earlier Version: Theorem Proving for Hierarchic First-Order Theories, in Giorgio Levi and H{\'e}l{\`e}ne Kirchner, editors, {\em Algebraic and Logic Programming, Third International Conference}, LNCS 632, pages 420--434, Volterra, Italy, September 2--4, 1992, Springer-Verlag},
}

Entry last modified by Christine Kiesel, 03/12/2010
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)
Harald Ganzinger		Created
01/22/1995 02:33:04 PM
Revisions
18.
17.
16.
15.
14.		Editor(s)
Christine Kiesel
Christine Kiesel
Uwe Brahm
Uwe Brahm
Uwe Brahm		Edit Dates
05.09.2001 16:35:42
28.08.2001 16:55:38
03/27/98 09:53:30 PM
03/27/98 09:49:11 PM
03/27/98 09:40:26 PM