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

Ludwig, Michel; Waldmann, Uwe

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

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1327697_3

DetailsSummary

Released

Conference Paper

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

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

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

Abstract

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.