On Minimal Constraint Networks
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter conjectured this computation problem to be NP-hard. We prove thi...
Hovedforfatter: | Gottlob, G |
---|---|
Format: | Journal article |
Sprog: | English |
Udgivet: |
2011
|
Lignende værker
-
On Minimal Constraint Networks
af: Gottlob, G
Udgivet: (2011) -
On Tractable Queries and Constraints
af: Gottlob, G, et al.
Udgivet: (1999) -
Semantic acyclicity under constraints
af: Gottlob, G, et al.
Udgivet: (2016) -
Semantic acyclicity under constraints
af: Barceló, P, et al.
Udgivet: (2016) -
Conditional Constraint Satisfaction: Logical Foundations and Complexity
af: Gottlob, G, et al.
Udgivet: (2007)