Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Müller, Martin
Niehren, Joachim
Podelski, Andreas

dblp
dblp
dblp



BibTeX cite key*:

MNP:Constraints99

Title

Title*:

Ordering Constraints over Feature Trees

Journal

Journal Title*:

Constraints

Journal's URL:

http://www.wkap.nl/journalhome.htm/1383-7133

Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:

Kluwer

Publisher's URL:

http://www.wkap.nl/

Publisher's
Address:

Dordrecht, the Netherlands

ISSN:

1383-7133

Vol, No, pp, Date

Volume*:

5

Number:

1/2

Publishing Date:

January 2000

Pages*:

7-41

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:


(LaTeX) Abstract:

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)$.

URL for the Abstract:


Categories,
Keywords:

feature constraints, tree orderings, weak subsumption, satisfiability, entailment, complexity

HyperLinks / References / URLs:

http://www.mpi-sb.mpg.de/~podelski/papers/featureorderings.ps

Copyright Message:


Personal Comments:


Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat


BibTeX Entry:

@ARTICLE{MNP:Constraints99,
AUTHOR = {M{\"u}ller, Martin and Niehren, Joachim and Podelski, Andreas},
TITLE = {Ordering Constraints over Feature Trees},
JOURNAL = {Constraints},
PUBLISHER = {Kluwer},
YEAR = {2000},
NUMBER = {1/2},
VOLUME = {5},
PAGES = {7--41},
ADDRESS = {Dordrecht, the Netherlands},
MONTH = {January},
ISBN = {1383-7133},
}


Entry last modified by Uwe Brahm, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Andreas Podelski
Created
01/18/1999 04:51:58 PM
Revisions
8.
7.
6.
5.
4.
Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Christine Kiesel
Christine Kiesel
Edit Dates
04/04/2001 06:25:48 PM
04/04/2001 06:25:36 PM
04/04/2001 06:25:05 PM
14.03.2001 13:19:36
14.03.2001 13:15:45