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...
Prif Awdur: | Gottlob, G |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
2011
|
Eitemau Tebyg
-
On Minimal Constraint Networks
gan: Gottlob, G
Cyhoeddwyd: (2011) -
On Tractable Queries and Constraints
gan: Gottlob, G, et al.
Cyhoeddwyd: (1999) -
Semantic acyclicity under constraints
gan: Gottlob, G, et al.
Cyhoeddwyd: (2016) -
Semantic acyclicity under constraints
gan: Barceló, P, et al.
Cyhoeddwyd: (2016) -
Conditional Constraint Satisfaction: Logical Foundations and Complexity
gan: Gottlob, G, et al.
Cyhoeddwyd: (2007)