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

Michel Ludwig and Uwe Waldmann

In Nachum Dershowitz and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, LNAI 4790, pages 348-362, Yerevan, Armenia, October 15-19, 2007. Springer-Verlag.

Submitted version: [PDF file, 161 kB, © Springer-Verlag]

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.


Previous | Up | Next
Uwe Waldmann <uwe@mpi-inf.mpg.de>, 2013-04-17.
Imprint | Data Protection