English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)

Ganzinger, H., & Waldmann, U. (1996). Theorem Proving in Cancellative Abelian Monoids (Extended Abstract). In M. A. McRobbie, & J. K. Slaney (Eds.), Automated Deduction - CADE-13 (pp. 388-402). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC21-A Version Permalink: https://hdl.handle.net/21.11116/0000-000E-38D8-0
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://rdcu.be/dv0xz (Publisher version)
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Ganzinger, Harald1, Author           
Waldmann, Uwe1, 2, Author                 
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              
2Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121996
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519898
Other: Local-ID: C1256104005ECAFC-D3B31BC55873B750C12564610057884F-GanzingerWaldmann1996CADE
BibTex Citekey: Ganzinger-Waldmann_CADE96
DOI: 10.1007/3-540-61511-3_102
 Degree: -

Event

show
hide
Title: 13th International Conference on Automated Deduction
Place of Event: New Brunswick, USA
Start-/End Date: 1996-07-30 - 1996-08-03

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automated Deduction - CADE-13
  Subtitle : 13th International Conference on Automated Deduction
  Abbreviation : CADE 1996
Source Genre: Proceedings
 Creator(s):
McRobbie, Michael A.1, Editor
Slaney, John K.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 388 - 402 Identifier: ISBN: 978-3-540-61511-8

Source 2

show
hide
Title: Lecture Notes in Artificial Intelligence
  Abbreviation : LNAI
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 1104 Sequence Number: - Start / End Page: - Identifier: -