An initial study of time complexity in infinite-domain constraint satisfaction

&
Artificial Intelligence 245 (C):115-133 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2017.01.005

Links

PhilArchive



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

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.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Constraint Satisfaction, Irredundant Axiomatisability and Continuous Colouring.Marcel Jackson & Belinda Trotta - 2013 - Studia Logica 101 (1):65-94.
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
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.
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.
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Domain permutation reduction for constraint satisfaction problems.Martin J. Green & David A. Cohen - 2008 - Artificial Intelligence 172 (8-9):1094-1118.
The complexity of constraint satisfaction problems for small relation algebras.M. Cristani & R. Hirsch - 2004 - Artificial Intelligence 156 (2):177-196.
On the parallel complexity of discrete relaxation in constraint satisfaction networks.Simon Kasif - 1990 - Artificial Intelligence 45 (3):275-286.
The sigma profile: A formal tool to study organization and its evolution at multiple scales.Carlos Gershenson - 2011 - Complexity 16 (5):37-44.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,638,237)

6 months
1 (#1,507,095)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Reasoning about partially ordered events.Thomas Dean & Mark Boddy - 1988 - Artificial Intelligence 36 (3):375-399.

View all 8 references / Add more references