Open AccessBook
Foundations of Constraint Satisfaction
Reads0
Chats0
TLDR
Introduction to the C SP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic search strategies for solving CSPs search orders in searching in C SPs exploitation of problem specific features stochastic search methods.Abstract:
Introduction to the CSP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic search strategies for solving CSPs search orders in searching in CSPs exploitation of problem specific features stochastic search methods for CSPs solution synthesis optimization in CSPs.read more
Citations
More filters
Book
Multiagent Systems : A Modern Approach to Distributed Artificial Intelligence
TL;DR: This is the first comprehensive introduction to multiagent systems and contemporary distributed artificial intelligence and will be a useful reference not only for computer scientists and engineers, but for social scientists and management and organization scientists as well.
Book
Constraint Processing
TL;DR: Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.
Journal ArticleDOI
Constraint logic programming : A survey
Joxan Jaffar,Michael J. Maher +1 more
TL;DR: This survey of CLP is to give a systematic description of the major trends in terms of common fundamental concepts and the three main parts cover the theory, implementation issues, and programming for applications.
Book
Handbook of Constraint Programming
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
Journal ArticleDOI
Resource-constrained project scheduling: Notation, classification, models, and methods
TL;DR: A classification scheme is provided, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far, and a unifying notation is proposed.
References
More filters
Proceedings ArticleDOI
Sketchpad: a man-machine graphical communication system
TL;DR: The Sketchpad system makes it possible for a man and a computer to converse rapidly through the medium of line drawings, and opens up a new area of man-machine communication.
Journal ArticleDOI
Constraint logic programming : A survey
Joxan Jaffar,Michael J. Maher +1 more
TL;DR: This survey of CLP is to give a systematic description of the major trends in terms of common fundamental concepts and the three main parts cover the theory, implementation issues, and programming for applications.
Journal ArticleDOI
Networks of constraints: Fundamental properties and applications to picture processing
TL;DR: Constraints are treated algebraically, and the solution of a system of linear equations in this algebra provides an approximation of the minimal network, and this solution is proved exact in special cases, e.g., for tree-like and series-parallel networks and for classes of relations for which a distributive property holds.
Proceedings Article
A filtering algorithm for constraints of difference in CSPs
TL;DR: A new filtering algorithm is presented that achieves the generalized arc-consistency condition for these non-binary constraints and has been successfully used in the system RESYN, to solve the subgraph isomorphism problem.
Proceedings Article
Valued constraint satisfaction problems: hard and easy problems
TL;DR: A simple algebraic framework is considered, related to Partial Constraint Satisfaction, which subsumes most of these proposals and is used to characterize existing proposals in terms of rationality and computational complexity.