On minimal constraint networks
From MaRDI portal
Publication:359976
DOI10.1016/j.artint.2012.07.006zbMath1270.68268OpenAlexW1628148094WikidataQ59259492 ScholiaQ59259492MaRDI QIDQ359976
Publication date: 23 August 2013
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0004370212000926
Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning, Computing and restoring global inverse consistency in interactive constraint satisfaction, Parameterized complexity classes beyond para-NP, On minimal constraint networks, Super-reparametrizations of weighted CSPs: properties and optimization perspective, On the Minimal Constraint Satisfaction Problem: Complexity and Generation, Pushing the frontier of minimality
Cites Work
- Unnamed Item
- Unnamed Item
- On minimal constraint networks
- Hypertree decompositions and tractable queries
- Principles and practice of constraint programming -- CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23--27, 2007. Proceedings
- World-set decompositions: Expressiveness and efficient algorithms
- Testing the universal instance assumption
- From local to global consistency
- Structure identification in relational data
- Decomposing constraint satisfaction problems using database techniques
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- A comparison of structural CSP decomposition methods
- Networks of constraints: Fundamental properties and applications to picture processing
- Relational hidden variables and non-locality
- Hypertree width and related hypergraph invariants
- Solution Enumeration for Projected Boolean Search Problems
- On the Complexity of Testing Implications of Functional and Join Dependencies
- Conflict-Driven Answer Set Enumeration
