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

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.

• Type: Conference
• Year: 2007
• Where: LPAR
• Authors: Michel Ludwig, Uwe Waldmann
• Keywords: Artificial Intelligence, Hierarchic Superposition Calculi, Knuth-Bendix Ordering, LPAR 2007, Path Ordering