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...
Hovedforfatter: | Gottlob, G |
---|---|
Format: | Conference item |
Udgivet: |
Perugia‚ Italy
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)