Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Ordering Constraints over Feature Trees

Müller, M., Niehren, J., & Podelski, A. (2000). Ordering Constraints over Feature Trees. Constraints, 5(1/2), 7-41.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3453-7 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3454-5
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Müller, Martin, Autor
Niehren, Joachim, Autor
Podelski, Andreas1, Autor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records and subtree selection constraints yield extensible and modular record descriptions. We introduce the constraint system \FEAT\ of ordering constraints interpreted over feature trees. Under the view that feature trees represent symbolic information, the $\leq$-relation corresponds to the information ordering (``carries less information than''). We present a polynomial algorithm that decides the satisfiability of conjunctions of positive and negative information ordering constraints over feature trees. Our results include algorithms for the satisfiability problem and the entailment problem of \FEAT\ in time $O(n^3)$. We also show that \FEAT\ has the independence property (and are thus able to handle negative conjuncts via entailment). Furthermore, we reduce the satisfiability problem of D\"orre's weak-subsumption constraints to the satisfiability problem of \FEAT. This improves the complexity bound for solving weak subsumption constraints from $O(n^5)$ to $O(n^3)$.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-122000
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 519681
Anderer: Local-ID: C1256104005ECAFC-FC3F60F9A0443F6F412566FD005727D1-MNP:Constraints99
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Constraints
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 5 (1/2) Artikelnummer: - Start- / Endseite: 7 - 41 Identifikator: ISSN: 1383-7133