Random constraint satisfaction: Easy generation of hard (satisfiable) instances

, , &
Artificial Intelligence 171 (8-9):514-534 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2007.04.001

Links

PhilArchive



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

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

Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
Evolution of meaningful information generation through the evolution of life (Biosemiotics Gatherings 2003).Christophe Menant - manuscript
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Sensorimotor process with constraint satisfaction. Grounding of meaning (EUCogII 2009).Christophe Menant - manuscript
On the phase transitions of random k-constraint satisfaction problems.Yun Fan & Jing Shen - 2011 - Artificial Intelligence 175 (3-4):914-927.
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses.Eli Shamir - 2006 - Logic Journal of the IGPL 14 (5):815-825.
A general model and thresholds for random constraint satisfaction problems.Yun Fan, Jing Shen & Ke Xu - 2012 - Artificial Intelligence 193 (C):1-17.
Computing and restoring global inverse consistency in interactive constraint satisfaction.Christian Bessiere, Hélène Fargier & Christophe Lecoutre - 2016 - Artificial Intelligence 241 (C):153-169.
Meaning generation for constraint satisfaction. An evolutionary thread for biosemiotics (Biosemiotics Gatherings 2016).Christophe Menant - manuscript
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 Problem of Consciousness: Easy, Hard or Tricky?Tom McClelland - 2017 - Topoi 36 (1):17-30.
How Not to Characterise a Hard Choice.Kevin Reuter & Michael Messerli - 2017 - Ratio 30 (4):494-521.
Introduction to a Systemic Theory of Meaning (Jan 2010 update).Christophe Menant - manuscript
A Compactness Theorem For Infinite Constraint Satisfaction.Robert Cowen - 1998 - Reports on Mathematical Logic:97-107.
Information, Constraint and Meaning. From the pre-biotic world to a possible post human one. An evolutionary approach (IS4SI 2017).Christophe Menant - manuscript

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,534,306)

6 months
3 (#962,966)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

View all 10 citations / Add more citations

References found in this work

Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.

View all 6 references / Add more references