TY  - RPRT
T1  - Ordering constraints on trees 
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1994
A1  - Comon,Hubert
A1  - Treinen,Ralf
Y1  - 2011/06/28
N2  - We survey recent results about ordering constraints on trees and discuss their applications. Our main interest lies in the family of recursive path orderings which enjoy the properties of being total, well-founded and compatible with the tree constructors. The paper includes some new results, in particular the undecidability of the theory of lexicographic path orderings in case of a non-unary signature. 
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/3718
ER  -