Generalized definite set constraints (Q1975208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized definite set constraints |
scientific article; zbMATH DE number 1428432
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized definite set constraints |
scientific article; zbMATH DE number 1428432 |
Statements
Generalized definite set constraints (English)
0 references
29 January 2001
0 references
Building neatly on results of N. Heintze and J. Jaffar on a decision procedure for a class of Herbrand set constraints, the authors prove several interesting results on the computational complexity of set constraints. E.g., they present an algorithm which provides a DEXPTIME test for the satisfiability problem of shallow systems of generalized definite set constraints. The algorithm for the satisfiability problem is based on use of deterministic bottom-up tree automata.
0 references
computational complexity of set constraints
0 references
algorithm
0 references
satisfiability problem
0 references
tree automata
0 references
