日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

Superposition for Divisible Torsion-Free Abelian Groups

MPS-Authors
/persons/resource/persons45689

Waldmann,  Uwe       
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Waldmann, U. (1998). Superposition for Divisible Torsion-Free Abelian Groups. In C., Kirchner, & H., Kirchner (Eds.), Proceedings of the 15th International Conference on Automated Deduction (CADE-98) (pp. 144-159). Berlin, Germany: Springer.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-3894-C
要旨
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving calculi. In the presence of the axioms of abelian groups or at least cancellative abelian monoids, ordering restrictions allow us to avoid some of these overlaps, but inferences with unshielded variables remain necessary. In divisible torsion-free abelian groups, for instance the rational numbers, every clause can be transformed into an equivalent clause without unshielded variables. We show how such a variable elimination algorithm can be integrated into the cancellative superposition calculus. The resulting calculus is refutationally complete with respect to the axioms of divisible torsion-free abelian groups and allows us to dispense with variable overlaps altogether. If abstractions are performed eagerly, the calculus makes it furthermore possible to avoid the computation of AC unifiers and AC orderings.