English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)

Waldmann, U. (2002). Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II). Journal of Symbolic Computation, 33, 831-861.

Item is

Files

show Files

Locators

show

Creators

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

Content

show
hide
Free keywords: -
 Abstract: Cancellative superposition is a refutationally complete calculus for first-order equational theorem proving in the presence of the axioms of cancellative abelian monoids, and, optionally, the torsion-freeness axioms. Thanks to strengthened ordering restrictions, cancellative superposition avoids some of the inefficiencies of classical AC-superposition calculi. We show how the efficiency of cancellative superposition can be further improved by using variable elimination techniques, leading to a significant reduction of the number of variable overlaps. In particular, we demonstrate that in divisible torsion-free abelian groups, variable overlaps, AC-unification and AC-orderings can be avoided completely.

Details

show
hide
Language(s): eng - English
 Dates: 2003-07-292002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 202052
Other: Local-ID: C1256104005ECAFC-B3DB8397B9661C6DC1256CAE005B88DB-Waldmann2002bJSC
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Symbolic Computation
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 33 Sequence Number: - Start / End Page: 831 - 861 Identifier: ISSN: 0747-7171