Cancellative Abelian Monoids in Refutational Theorem Proving

Waldmann, Uwe

Datensatz

DATENSATZ AKTIONENEXPORT

DownloadE-Mail

Bitte beachten Sie, dass eine neuere Version dieses Datensatzes verfügbar ist:
https://pure.mpg.de/pubman/item/item_1331481_3

DetailsÜbersicht

Cancellative Abelian Monoids in Refutational Theorem Proving

Waldmann, U. (1997). Cancellative Abelian Monoids in Refutational Theorem Proving. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is Freigegeben

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:

Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-38BE-0 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-ACD2-6

Genre: Hochschulschrift

ausblenden:

Urheber:
Waldmann, Uwe^{1, 2}, Autor

Affiliations:
1Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545
2Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

Inhalt

einblenden:

ausblenden:

Schlagwörter: -

Zusammenfassung: We present a constraint superposition calculus in which the axioms of cancellative abelian monoids and, optionally, further axioms (e.g., torsion-freeness) are integrated. Cancellative abelian monoids comprise abelian groups, but also such ubiquitous structures as the natural numbers or multisets. Our calculus requires neither extended clauses nor explicit inferences with the theory axioms. The number of variable overlaps is significantly reduced by strong ordering restrictions and powerful variable elimination techniques; in divisible torsion-free abelian groups, variable overlaps can even be avoided completely. Thanks to the equivalence of torsion-free cancellative and totally ordered abelian monoids, our calculus allows us to solve equational problems in totally ordered abelian monoids without requiring a detour via ordering literals.