On minimal constraint networks
type: Item
instance of: scholarly article
title: On minimal constraint networks
zbMATH Open document ID: 1270.68268
author: Georg Gottlob
published in: Artificial Intelligence
publication date: 2013-08-23T00:00:00Z
full work available at URL: S0004370212000926
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6201262
MaRDI profile type: Publication
OpenAlex ID: W1628148094
Wikidata QID: Q59259492
cites work: Relational hidden variables and non-locality
cites work: Hypertree width and related hypergraph invariants
cites work: Principles and practice of constraint programming -- CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23--27, 2007. Proceedings
cites work: From local to global consistency
cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
cites work: Structure identification in relational data
cites work: Conflict-Driven Answer Set Enumeration
cites work: Solution Enumeration for Projected Boolean Search Problems
cites work: A comparison of structural CSP decomposition methods
cites work: Q4779133
cites work: Hypertree decompositions and tractable queries
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: Testing the universal instance assumption
cites work: Q3668890
cites work: On the Complexity of Testing Implications of Functional and Join Dependencies
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: World-set decompositions: Expressiveness and efficient algorithms
DBLP publication ID: journals/ai/Gottlob12
DOI: 10.1016/J.ARTINT.2012.07.006
description: scientific article; zbMATH DE number 6201262