A knowledge representation for constraint satisfaction problems
نویسندگان
چکیده
منابع مشابه
A Knowledge Representation for Constraint Satisfaction Problems
In this paper we present a general representation for constraint satisfaction problems (CSP) and a framework for reasoning about their solution that unlike most constraint-based relaxation algorithms. stresses the need for a "natural" encoding of constraint knowledge and can facilitate making inferences for propagation, backtracking, and explanation. The representation consists o i two componen...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA Space-Efficient Backtrack-Free Representation for Constraint Satisfaction Problems
In this paper we present a radical approach to obtaining a backtrack-free representation for a constraint satisfaction problem: remove values that lead to deadends. This technique does not require additional space but has the drawback of removing solutions. We investigate a number of variations on the basic algorithm including the use of seed solutions, consistency techniques, and a variety of ...
متن کاملA Framework for Expressing Knowledge about Constraint Satisfaction Problems
This paper describes a framework for expressing and solving combinatorial problems. The framework is especially designed to allow the expression of various types of knowledge on problem domains, that can be exploited by the resolution mechanism to speed up the search. We illustrate the framework and the types of knowledge on a crossword example.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 1993
ISSN: 1041-4347
DOI: 10.1109/69.243506