Theory path orderings

Stuber, Jürgen

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Theory path orderings

MPS-Authors

/persons/resource/persons45567

Stuber, Jürgen
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

引用

Stuber, J. (1999). Theory path orderings. In P., Narendran, & M., Rusinowitch (Eds.), Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA-99) (pp. 148-162). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-36A3-5

要旨

We introduce the notion of a theory path ordering~(TPO), which simplifies the construction of term orderings for superposition theorem proving in algebraic theories. To achieve refutational completeness of such calculi we need total, $E$-compatible and $E$-antisymmetric simplification quasi-orderings. The construction of a TPO takes as its ingredients a status function for interpreted function symbols and a precedence that makes the interpreted function symbols minimal. The properties of the ordering then follow from related properties of the status function. Theory path orderings generalize associative path orderings.