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):

Waldmann, Uwe

dblp



Editor(s):

Goré, Rajeev
Leitsch, Alexander
Nipkow, Tobias

dblp
dblp
dblp



BibTeX cite key*:

Waldmann2001IJCAR

Title, Booktitle

Title*:

Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)

Booktitle*:

Automated reasoning : First International Joint Conference, IJCAR 2001

Event, URLs

URL of the conference:

http://www.dii.unisi.it/~ijcar/

URL for downloading the paper:

http://link.springer.de/link/service/series/0558/papers/2083/20830226.pdf

Event Address*:

Siena, Italy

Language:

English

Event Date*
(no longer used):

June, 18-22

Organization:


Event Start Date:

14 May 2003

Event End Date:

18 May 2003

Publisher

Name*:

Springer

URL:

http://www.springer.de/

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Artificial Intelligence

Volume:

2083

Number:


Month:


Pages:

226-241

Year*:

2001

VG Wort Pages:

26

ISBN/ISSN:

3-540-42254-4

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

We present a calculus for first-order theorem proving in the presence of the axioms of totally ordered divisible abelian groups. The calculus extends previous superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e.g., the rational numbers within a first-order theorem prover.

URL for the Abstract:

http://link.springer.de/link/service/series/0558/bibs/2083/20830226.htm

Keywords:

Automated Theorem Proving, Superposition, Chaining, First-Order Logic, Equality, Totally Ordered Divisible Abelian Groups, Term Rewriting, Variable Elimination



Download
Access Level:


Correlation

MPG Unit:




MPG Subunit:


Audience:

Expert

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{Waldmann2001IJCAR,
AUTHOR = {Waldmann, Uwe},
EDITOR = {Gor{\'e}, Rajeev and Leitsch, Alexander and Nipkow, Tobias},
TITLE = {Superposition and Chaining for Totally Ordered Divisible Abelian Groups ({Extended} Abstract)},
BOOKTITLE = {Automated reasoning : First International Joint Conference, IJCAR 2001},
PUBLISHER = {Springer},
YEAR = {2001},
VOLUME = {2083},
PAGES = {226--241},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {Siena, Italy},
ISBN = {3-540-42254-4},
}


Entry last modified by Christine Kiesel, 11/07/2006
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)
Uwe Waldmann
Created
11/07/2006 11:46:09 AM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Uwe Waldmann
Manfred Jaeger
Christine Kiesel
Christine Kiesel
Edit Dates
14.05.2003 18:43:10
04/10/2003 06:11:48 PM
31/08/2001 18:17:06
31.08.2001 02:47:15 PM
17/07/2001 17:15:53