Constraint satisfaction problem
Semantic Scholar uses AI to extract papers important to this topic.
Preface 1. Introduction 2. Complexity Classes 3. Boolean Constraint Satisfaction Problems 4. Characterizations of Constraint… Expand A constraint satisfaction problem requires a value, selected from a given finite domain, to be assigned to each variable in the… Expand We develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving… Expand Conjunctive-query containment is recognized as a fundamental problem in database query evaluation and optimization. At the same… Expand In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been… Expand Introduction to the CSP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic… Expand A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint… Expand Abstract A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of… Expand Abstract This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a… Expand Abstract In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems… Expand