Domain permutation reduction for constraint satisfaction problems

&
Artificial Intelligence 172 (8-9):1094-1118 (2008)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2007.12.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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 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.
Decomposing constraint satisfaction problems using database techniques.Marc Gyssens, Peter G. Jeavons & David A. Cohen - 1994 - Artificial Intelligence 66 (1):57-89.
A note on satisfaction, truth and the empty domain.Timothy Williamson - unknown
A note on truth, satisfaction and the empty domain.Timothy Williamson - 1999 - Analysis 59 (1):3–8.
Cognitive dissonance reduction as constraint satisfaction.Thomas R. Shultz & Mark R. Lepper - 1996 - Psychological Review 103 (2):219-240.
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.Marcel Jackson & Belinda Trotta - 2013 - Studia Logica 101 (1):65-94.
Fundamental properties of neighbourhood substitution in constraint satisfaction problems.Martin C. Cooper - 1997 - Artificial Intelligence 90 (1-2):1-24.
Locating the phase transition in binary constraint satisfaction problems.Barbara M. Smith & Martin E. Dyer - 1996 - Artificial Intelligence 81 (1-2):155-181.
An initial study of time complexity in infinite-domain constraint satisfaction.Peter Jonsson & Victor Lagerkvist - 2017 - Artificial Intelligence 245 (C):115-133.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
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.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,469,565)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

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.
Reasoning about qualitative temporal information.Peter van Beek - 1992 - Artificial Intelligence 58 (1-3):297-326.

View all 9 references / Add more references