Skip to search formSkip to main contentSkip to account menu

Constraint satisfaction problem

Known as: Constraint-satisfaction problem, Constraint solving, MAX-CSP 
Constraint satisfaction problems (CSPs) are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
My thesis is concerned with Boolean constraint satisfaction problems (CSP). A constraint consists of a set of variables and a… 
Highly Cited
2003
Highly Cited
2003
Foreword.Preface.1. Fundamental Logic and the Definition of Engineering Tasks.Three Types of Inference.Engineering Tasks.A Model… 
2001
2001
In the last ten years we witnessed a rapid development of alternative logical systems, called non-monotonic logics (Baral… 
1999
1999
Fuzzy constraint satisfaction problems (FCSPs) extend standard (crisp) constraint satisfaction problems (CSPs) by introducing a… 
1999
1999
Conventional constraint satisfaction problem (CSP) formulations are static. There is a given set of constraints and variables… 
1999
1999
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and… 
1997
1997
Many problems in artificial intelligence and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP… 
1996
1996
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications… 
1996
1996
The constraint satisfaction problem (CSP) is a potential area of application for anytime methods. In this work we derive anytime… 
1989
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem…