Comparing Partial Consistencies

Hélène Collavizza (), François Delobel () and Michel Rueher ()
Additional contact information
Hélène Collavizza: Université de Nice—Sophia-Antipolis, 13S, ESSI
François Delobel: Université de Nice—Sophia-Antipolis, 13S, ESSI
Michel Rueher: Université de Nice—Sophia-Antipolis, 13S, ESSI

A chapter in Developments in Reliable Computing, 1999, pp 213-228 from Springer

Abstract: Abstract Global search algorithms have been widely used in the constraint programming framework to solve constraint systems over continuous domains. This paper precisely states the relations among the different partial consistencies which are main emphasis of these algorithms. The capability of these partial consistencies to handle the so-called dependency problem is analysed and some efficiency aspects of the filtering algorithms are mentioned.

Keywords: Interval Analysis; Constraint System; Interval Arithmetic; Interval Extension; Multiple Occurrence (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-017-1247-7_17

Ordering information: This item can be ordered from
http://www.springer.com/9789401712477

DOI: 10.1007/978-94-017-1247-7_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().