Partial Constraint Satisfaction

Freuder, Eugene C.

Partial Constraint Satisfaction

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Search. Pages 278-282.

Abstract

A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem in an "optimal" or "sufficient" sense. A formal model is presented for defining and studying such partial constraint satisfaction problems. The basic components of this model are a constraint satisfaction problem, a problem space, and a metric on that space. Algorithms for solving partial constraint satisfaction problems are discussed. A specific branch and bound algorithm is described. Some initial experimental experience with this algorithm is presented.

Eugene C. Freuder. 1989. Partial Constraint Satisfaction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89. IJCAI, 278–282. https://ijcai.org/proceedings/1989/44

@inproceedings{ijcai1989p44,
  title     = {Partial Constraint Satisfaction},
  author    = {Freuder, Eugene C.},
  booktitle = {Proceedings of the Eleventh International Joint Conference on
               Artificial Intelligence, {IJCAI-89}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {N. S. Sridharan},
  pages     = {278--282},
  year      = {1989},
  month     = {8},
  note      = {Search},
  url       = {https://ijcai.org/proceedings/1989/44},
}

TY  - CPAPER
TI  - Partial Constraint Satisfaction
AU  - Freuder, Eugene C.
T2  - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1989
SP  - 278
EP  - 282
UR  - https://ijcai.org/proceedings/1989/44
ER  -