Consistency Techniques for Numeric CSPs

Lhomme, Olivier

Consistency Techniques for Numeric CSPs

Download BibTeX Cite

Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Constraint Satisfaction Problems. Pages 232-237.

Abstract

Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the consistency techniques that have been developed for CSPs can be adapted to numeric CSPs. Since the numeric domains are ordered the underlying idea is to handle domains only by their bounds. The semantics that have been elaborated, plus the complexity analysis and good experimental results, confirm that these techniques can be used in real applications.

Olivier Lhomme. 1993. Consistency Techniques for Numeric CSPs. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93. IJCAI, 232–237. https://ijcai.org/proceedings/1993/33

@inproceedings{ijcai1993p33,
  title     = {Consistency Techniques for Numeric CSPs},
  author    = {Lhomme, Olivier},
  booktitle = {Proceedings of the Thirteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-93}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Ruzena Bajcsy},
  pages     = {232--237},
  year      = {1993},
  note      = {Constraint Satisfaction Problems},
  url       = {https://ijcai.org/proceedings/1993/33},
}

TY  - CPAPER
TI  - Consistency Techniques for Numeric CSPs
AU  - Lhomme, Olivier
T2  - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1993
SP  - 232
EP  - 237
UR  - https://ijcai.org/proceedings/1993/33
ER  -