On minimal constraint networks

Authors:
Georg Gottlob
Affiliations:
Computer Science Department and Oxford Man Institute, University of Oxford, Oxford, UK
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 8
Cited 4

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
Fundamental properties of networks of constraints: A new formulation

Search in Artificial Intelligence
From local to global consistency

Artificial Intelligence
Structure identification in relational data

Artificial Intelligence - Special volume on constraint-based reasoning
On the Complexity of Testing Implications of Functional and Join Dependencies

Journal of the ACM (JACM)
Configuring Large Systems Using Generative Constraint Satisfaction

IEEE Intelligent Systems
Constraint Processing

Constraint Processing
Theory of Relational Databases

Theory of Relational Databases

FDB: a query engine for factorised relational databases

Proceedings of the VLDB Endowment
On minimal constraint networks

Artificial Intelligence
Solving minimal constraint networks in qualitative spatial and temporal reasoning

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Aggregation and ordering in factorised databases

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 decide whether a constraint network can be decomposed into an equivalent k-ary constraint network, and study related questions.