On Minimal Constraint Networks
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. It was conjectured that computing a solution to such a network is NP hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k ≥ 2 it is NP-hard to dec...
Prif Awdur: | Gottlob, G |
---|---|
Fformat: | Conference item |
Cyhoeddwyd: |
Perugia‚ Italy
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)