Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,031,287 papers from all fields of science
Search
Sign In
Create Free Account
Constraint satisfaction problem
Known as:
Constraint-satisfaction problem
, Constraint solving
, MAX-CSP
Expand
Constraint satisfaction problems (CSPs) are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AC-3 algorithm
Algorithm Selection
Anatree
Answer set programming
Expand
Broader (1)
Constraint programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Task Management under Change and Uncertainty Constraint Solving Experience with the CALO Project
P. Berry
,
Karen L. Myers
,
Tomás E. Uribe
,
N. Yorke-Smith
2005
Corpus ID: 6837410
The goal of CALO (Cognitive Assistant that Learns and Organizes) is to design an automated personal assistant to support a busy…
Expand
Highly Cited
2003
Highly Cited
2003
Fundamentals of Computer-Aided Engineering
B. Raphael
,
I. Smith
2003
Corpus ID: 267884239
Foreword.Preface.1. Fundamental Logic and the Definition of Engineering Tasks.Three Types of Inference.Engineering Tasks.A Model…
Expand
1999
1999
On Linguistic Fuzzy Constraint Satisfaction Problems
R. Kowalczyk
1999
Corpus ID: 118226396
Fuzzy constraint satisfaction problems (FCSPs) extend standard (crisp) constraint satisfaction problems (CSPs) by introducing a…
Expand
1999
1999
Structural Constraint Satisfaction
A. Nareyek
1999
Corpus ID: 14920917
Conventional constraint satisfaction problem (CSP) formulations are static. There is a given set of constraints and variables…
Expand
1999
1999
Tile Transition Systems as Structured Coalgebras
A. Corradini
,
R. Heckel
,
U. Montanari
International Symposium on Fundamentals of…
1999
Corpus ID: 14451749
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and…
Expand
1997
1997
Phase transition behaviour in constraint satisfaction problems
S. Grant
1997
Corpus ID: 44669254
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP…
Expand
1996
1996
Context in Discrete Constraint Satisfaction Problems
R. Weigel
,
B. Faltings
,
B. Choueiry
European Conference on Artificial Intelligence
1996
Corpus ID: 10187178
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications…
Expand
1996
1996
Anytime algorithms for constraint satisfaction and SAT problems
R. Wallace
,
Eugene C. Freuder
SGAR
1996
Corpus ID: 8250394
The constraint satisfaction problem (CSP) is a potential area of application for anytime methods. In this work we derive anytime…
Expand
1993
1993
Solving Space Planning Problems Using Constraint Technology
Philippe Charman
1993
Corpus ID: 11260800
Constraint programming techniques have proven their eeciency in solving high combinatory problems. In this paper, we study the…
Expand
1989
1989
An Algebraic Approach to Constraint Satisfaction Problems
Igor Rivin
,
R. Zabih
International Joint Conference on Artificial…
1989
Corpus ID: 10933227
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem…
Expand