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...
मुख्य लेखक: | Gottlob, G |
---|---|
स्वरूप: | Conference item |
प्रकाशित: |
Perugia‚ Italy
2011
|
समान संसाधन
-
On Minimal Constraint Networks
द्वारा: Gottlob, G
प्रकाशित: (2011) -
On Tractable Queries and Constraints
द्वारा: Gottlob, G, और अन्य
प्रकाशित: (1999) -
Semantic acyclicity under constraints
द्वारा: Gottlob, G, और अन्य
प्रकाशित: (2016) -
Semantic acyclicity under constraints
द्वारा: Barceló, P, और अन्य
प्रकाशित: (2016) -
Conditional Constraint Satisfaction: Logical Foundations and Complexity
द्वारा: Gottlob, G, और अन्य
प्रकाशित: (2007)