Constraint satisfaction from a deductive viewpoint
From MaRDI portal
Publication:1103421
DOI10.1016/0004-3702(88)90023-9zbMath0645.68112OpenAlexW13455872MaRDI QIDQ1103421
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(88)90023-9
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)
Related Items
Automated reasoning and exhaustive search: Quasigroup existence problems, On the parallel complexity of discrete relaxation in constraint satisfaction networks, Revisiting global constraint satisfaction, Constraint satisfaction -- algorithms and complexity analysis, The logic of constraint satisfaction, Hypertree decompositions and tractable queries, Diagnosing tree-structured systems, A logical framework for depiction and image interpretation, Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, Let's plan it deductively!, Exploiting functional dependencies in declarative problem specifications, Constraint propagation techniques for the disjunctive scheduling problem, A Logical Approach to Constraint Satisfaction, A comparison of structural CSP decomposition methods, Conjunctive-query containment and constraint satisfaction, Fixed-parameter complexity in AI and nonmonotonic reasoning, Decomposing constraint satisfaction problems using database techniques
Cites Work
