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...
Главный автор: | Gottlob, G |
---|---|
Формат: | Journal article |
Язык: | English |
Опубликовано: |
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)