Please use this identifier to cite or link to this item:
doi:10.22028/D291-24935 | Title: | Ordering constraints on trees |
| Author(s): | Comon, Hubert Treinen, Ralf |
| Language: | English |
| Year of Publication: | 1994 |
| OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1994 |
| SWD key words: | Künstliche Intelligenz |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | 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. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-37185 hdl:20.500.11880/24991 http://dx.doi.org/10.22028/D291-24935 |
| Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
| Series volume: | 94-12 |
| Date of registration: | 28-Jun-2011 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| RR_94_12.pdf | 181,04 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.