MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Ganzinger, Harald
Waldmann, Uwe		dblp
dblp
Editor(s):
McRobbie, Michael A.
Slaney, John K.		dblp
dblp
BibTeX cite key*:
GanzingerWaldmann1996CADE
Title, Booktitle
Title*:
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
Booktitle*:
Proceedings of the 13th International Conference on Automated Deduction (CADE-13)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
New Brunswick, USA
Language:
English
Event Date*
(no longer used):
July, 30 - August, 3
Organization:
Event Start Date:
2 June 2024
Event End Date:
2 June 2024
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Artificial Intelligence
Volume:
1104
Number:
Month:
Pages:
388-402
Year*:
1996
VG Wort Pages:
ISBN/ISSN:
3-540-61511-3
Sequence Number:
DOI:
Note, Abstract, ©
Note:
Full version:
Technical Report MPI-I-96-2-001,
Max-Planck-Institut für Informatik, Saarbrücken, Germany,
January 1996.
(LaTeX) Abstract:
Cancellative abelian monoids encompass abelian groups,
but also such ubiquitous structures as the natural numbers or
multisets. Both the AC axioms and the cancellation law are
difficult for a general purpose theorem prover, as they create
many variants of clauses which contain sums. We describe a
refined superposition calculus for cancellative abelian monoids
which requires neither explicit inferences with the theory clauses
nor extended equations or clauses. Strong ordering constraints
allow us to restrict to inferences that involve the maximal term
of the maximal sum in the maximal literal. Besides, the search
space is reduced drastically by variable elimination techniques.
Keywords:
Theorem Proving
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:
@INPROCEEDINGS{GanzingerWaldmann1996CADE,
AUTHOR = {Ganzinger, Harald and Waldmann, Uwe},
 EDITOR = {McRobbie, Michael A. and Slaney, John K.},
 TITLE = {Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)},
 BOOKTITLE = {Proceedings of the 13th International Conference on Automated Deduction (CADE-13)},
 PUBLISHER = {Springer},
 YEAR = {1996},
 VOLUME = {1104},
 PAGES = {388--402},
 SERIES = {Lecture Notes in Artificial Intelligence},
 ADDRESS = {New Brunswick, USA},
 ISBN = {3-540-61511-3},
 NOTE = {Full version: Technical Report MPI-I-96-2-001,
Max-Planck-Institut für Informatik, Saarbrücken, Germany,
January 1996.},
}

Entry last modified by Christine Kiesel, 03/12/2010
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
03/21/1997 04:56:05 PM
Revisions
4.
3.
2.
1.
0.		Editor(s)
Christine Kiesel
Christine Kiesel
Uwe Brahm
Uwe Brahm
Uwe Brahm		Edit Dates
27/01/98 13:36:40
27/01/98 13:21:01
27.03.97 22:18:43
24.03.97 21:33:44
21/03/97 16:56:06