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

アイテム詳細


公開

会議論文

Ordered Chaining for Total Orderings

MPS-Authors
/persons/resource/persons44055

Bachmair,  Leo
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44474

Ganzinger,  Harald
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtoat
(出版社版)

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

Bachmair, L., & Ganzinger, H. (1994). Ordered Chaining for Total Orderings. In A., Bundy (Ed.), Proceedings of the 12th International Conference on Automated Deduction (CADE-12) (pp. 435-450). Berlin, Germany: Springer.


引用: https://hdl.handle.net/11858/00-001M-0000-0014-AD92-2
要旨
We propose inference systems based on ordered chaining and a concept of
(global) redundancy for clauses and inferences for dealing with total
orderings. A key to the practicality of chaining techniques is the extent to
which so-called variable chainings can be restricted. We demonstrate that
ordering restrictions and the rewrite techniques which account for their
completeness considerably restrict variable chaining. For dense total orderings
we show that the techniques for eliminating unshielded variables are admissible
simplifications so that no variable chaining is needed at all. We also include
equality by combining ordered chaining with superposition.