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)