Decomposing constraint satisfaction problems using database techniques

, &
Artificial Intelligence 66 (1):57-89 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(94)90003-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.Marcel Jackson & Belinda Trotta - 2013 - Studia Logica 101 (1):65-94.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.
Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.Martin C. Cooper, Peter G. Jeavons & András Z. Salamon - 2010 - Artificial Intelligence 174 (9-10):570-584.
Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
A general model and thresholds for random constraint satisfaction problems.Yun Fan, Jing Shen & Ke Xu - 2012 - Artificial Intelligence 193 (C):1-17.
The complexity of constraint satisfaction problems for small relation algebras.M. Cristani & R. Hirsch - 2004 - Artificial Intelligence 156 (2):177-196.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,163,565)

6 months
9 (#354,585)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
Constraints, consistency and closure.Peter Jeavons, David Cohen & Martin C. Cooper - 1998 - Artificial Intelligence 101 (1-2):251-265.
On minimal constraint networks.Georg Gottlob - 2012 - Artificial Intelligence 191-192 (C):42-60.

View all 8 citations / Add more citations

References found in this work

Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
Constraint satisfaction from a deductive viewpoint.W. Bibel - 1988 - Artificial Intelligence 35 (3):401-413.

Add more references