Abstract
A constraint system includes a set of variables and a set of relations among these variables, called constraints. The solution of a constraint system is an assignment of values to variables so that all, or many, of the relations are made true. A simple and efficient method for constraint resolution has been proposed in the work of B.N. Freeman-Benson, J. Maloney, and A. Borning. We show how their method is related to the classical problem of graph matching, and from this connection we derive new resolution algorithms.
Original language | English (US) |
---|---|
Pages (from-to) | 271-284 |
Number of pages | 14 |
Journal | Annals of Mathematics and Artificial Intelligence |
Volume | 8 |
Issue number | 3-4 |
DOIs | |
State | Published - Sep 1 1993 |
ASJC Scopus subject areas
- Artificial Intelligence
- Applied Mathematics