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:








Author, Editor

Author(s):

Ganzinger, Harald
Sofronie-Stokkermans, Viorica
Waldmann, Uwe

dblp
dblp
dblp



Editor(s):

Basin, David
Rusinowitch, Michael

dblp
dblp



BibTeX cite key*:

Ganzinger-SofronieStokkermans-Waldmann-ijcar-2004

Title, Booktitle

Title*:

Modular Proof Systems for Partial Functions with Weak Equality

Booktitle*:

Automated reasoning : Second International Joint Conference, IJCAR 2004

Event, URLs

URL of the conference:

http://www.4c.ucc.ie/ijcar/

URL for downloading the paper:


Event Address*:

Cork, Ireland

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

4 July 2004

Event End Date:

8 July 2004

Publisher

Name*:

Springer

URL:

http://www.springer.de/

Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Artificial Intelligence

Volume:

3097

Number:


Month:

June

Pages:

168-182

Year*:

2004

VG Wort Pages:

26

ISBN/ISSN:

3-540-22345-2

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

The paper presents a modular superposition calculus for the
combination of first-order theories involving both total
and partial functions. Modularity means that inferences are
pure, only involving clauses over the alphabet of either
one, but not both, of the theories. The calculus is shown
to be complete provided that functions that are not in the
intersection of the component signatures are declared as
partial. This result also means that if the
unsatisfiability of a goal modulo the combined theory does
not depend on the totality of the functions in the
extensions, the inconsistency will be effectively found.
Moreover, we consider a constraint superposition calculus
for the case of hierarchical theories and show that it has
a related modularity property. Finally we identify cases
where the partial models can always be made total so that
modular superposition is also complete with respect to the
standard (total function) semantics of the theories.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Ganzinger-SofronieStokkermans-Waldmann-ijcar-2004,
AUTHOR = {Ganzinger, Harald and Sofronie-Stokkermans, Viorica and Waldmann, Uwe},
EDITOR = {Basin, David and Rusinowitch, Michael},
TITLE = {Modular Proof Systems for Partial Functions with Weak Equality},
BOOKTITLE = {Automated reasoning : Second International Joint Conference, IJCAR 2004},
PUBLISHER = {Springer},
YEAR = {2004},
VOLUME = {3097},
PAGES = {168--182},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {Cork, Ireland},
MONTH = {June},
ISBN = {3-540-22345-2},
}


Entry last modified by Anja Becker, 02/02/2005
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)
Viorica Sofronie-Stokkermans
Created
06/07/2004 11:27:26 AM
Revisions
3.
2.
1.
0.
Editor(s)
Anja Becker
Uwe Waldmann
Viorica Sofronie-Stokkermans
Viorica Sofronie-Stokkermans
Edit Dates
02.02.2005 13:27:08
01/10/2005 02:19:42 PM
06/14/2004 01:29:37 PM
06/07/2004 11:27:26 AM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section