TY  - RPRT
T1  - The first-order theory of lexicographic path orderings is undecidable 
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1993
A1  - Comon,Hubert
A1  - Treinen,Ralf
Y1  - 2011/06/24
N2  - We show, under some assumption on the signature, that the *This formula not viewable on a Text-Browser* fragment of the theory of any lexicographic path ordering is undecidable. This applies to partial and to total precedences. Our result implies in particular that the simplification rule of ordered completion is undecidable. 
KW  - Künstliche Intelligenz
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3637
ER  -