The Constraint Satisfaction Problem and Universal Algebra

Bulletin of Symbolic Logic 21 (3):319-337 (2015)
  Copy   BIBTEX

Abstract

This paper gives a brief survey of current research on the complexity of the constraint satisfaction problem over fixed constraint languages.

Categories

Keywords

Reprint years

DOI

10.1017/bsl.2015.25

Links

PhilArchive



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

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.
A finite relation algebra with undecidable network satisfaction problem.Robin Hirsch - 1999 - Logic Journal of the IGPL 7 (4):547-554.
The universal group of a Heyting effect algebra.David J. Foulis - 2006 - Studia Logica 84 (3):407 - 424.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
The sweet mystery of compatibilism.Eugene Mills - 2006 - Acta Analytica 21 (4):50 - 61.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
Coherence: The price is right.Paul Thagard - 2012 - Southern Journal of Philosophy 50 (1):42-49.
Evolution of meaningful information generation through the evolution of life (Biosemiotics Gatherings 2003).Christophe Menant - manuscript
Algebraic Logic and Universal Algebra in Computer Science: Conference Proceedings.C. H. Bergman, R. D. Maddux & Don Pigozzi - 1990
Homogeneous and universal dedekind algebras.George Weaver - 2000 - Studia Logica 64 (2):173-192.
The Universal Theory of First Order Algebras and Various Reducts.Lawrence Valby - 2015 - Logica Universalis 9 (4):475-500.
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.Marcel Jackson & Belinda Trotta - 2013 - Studia Logica 101 (1):65-94.
A Variety Generated By A Finite Algebra With 2ω Subvarieties.Wieslaw Dziobiak - 1980 - Bulletin of the Section of Logic 9 (1):2-7.
Dominions in quasivarieties of universal algebras.Alexander Budkin - 2004 - Studia Logica 78 (1-2):107 - 127.

Analytics

Added to PP
2016-06-30

Downloads
13 (#1,036,661)

6 months
2 (#1,198,900)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references