An Extension of the Knuth-Bendix Ordering with LPO-like Properties

Ludwig, Michel; Waldmann, Uwe

doi:10.1007/978-3-540-75560-9_26

アイテム詳細

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

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1327697_3

詳細要約

公開

会議論文

An Extension of the Knuth-Bendix Ordering with LPO-like Properties

MPS-Authors

/persons/resource/persons44947

Ludwig, Michel
Programming Logics, MPI for Informatics, Max Planck Society;

/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

引用

Ludwig, M., & Waldmann, U. (2007). An Extension of the Knuth-Bendix Ordering with LPO-like Properties. In N., Dershowitz, & A., Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning: 14th International Conference, LPAR 2007 (pp. 348-362). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-1E13-4

要旨

The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the Knuth-Bendix ordering that makes it possible to overcome these restrictions.