A note on partial consistencies over continuous domains

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1520, Issue , 1998, Pages 147-161

  Collavizza, Hèlène ^a   Delobel, François ^a   Rueher, Michel ^a  

^a UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

B CONSISTENCIES; CONSTRAINT SYSTEMS; CONTINUOUS DOMAIN; FILTERING ALGORITHM; REAL NUMBER;

ALGORITHMS;

EID: 84957708039     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_12     Document Type: Conference Paper

References (27)

1. F. Benhamou, D. Mc Allester, and P. Van Hentenryck. CLP(Intervals) Revisited. in Proc. Logic Programming: Proceedings of the 1994 International Symposium, MIT Press, (1994).
2. F. Benhamou and W. Older. Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming, (1997).
3. C. Bliek. Computer Methods for Design Automation. PhD thesis, Massachusetts Institute of Technology, 1992.
4. R.P. Brent. A FORTRAN multiple-precision arithmetic package ACM Trans. On Math. Software, 4, no 1, 57-70, 1978.
5. J.C. Cleary. Logical arithmetic. Future Computing Systems, 2(2):125-149, 1987.
6. B. Faltings. Arc-consistency for continuous variables. Artificial Intelligence, vol. 65, pp. 363-376, 1994.
7. E. C. Freuder. Synthesizing constraint expressions. Communications of the ACM, 21:958-966, November 1978.
8. L. Granvilliers. On the combination of Box-consistency and Hull-consistency. Workshop ”Non binary constraints", ECAI-98, Brighton, 23-28 August 1998.
9. E. Hansen. Global optimization using interval analysis. Marcel Dekker, NY, 1992.
10. Hoon Hong and Volker Stahl. Safe starting regions by fixed points and tightening. Computing, 53:323-335, 1994.
11. E. Hyvőnen. Constraint reasoning based on interval arithmetic: the tolerance propagation approach. Artificial Intelligence, vol. 58, pp. 71-112, 1992.
12. H. Hong, V. Stahl. Safe Starting Regions by Fixed Points and Tightening. Com- puting, vol. 53, pp 323-335, 1994.
13. J. H. M. Lee and M. H. van Emden. Interval computation as deduction in CHIP. Journal of Logic Programming, 16:3-4, pp.255-276, 1993.
14. O. Lhomme. Consistency techniques for numeric CSPs. in Proc. IJCAI93, Cham- bery, (France), pp. 232-238, (August 1993).
15. O. Lhomme. Contribution à la rèsolution de contraintes sur les rèels par propaga- tion d'intervalles. PhD Thesis, University of Nice Sophia Antipolis - CNRS, Route des Colles, B.P. 145, 06903 Sophia Antipolis Cedex, France, 1994.
16. O. Lhomme and M. Rueher. Application des techniques CSP au raisonnement sur les intervalles. RIA (Dunod), vol. 11:3, pp. 283-312, 1997.
17. A. Mackworth. Consistency in networks of relations. Artificial Intelligence, vol. 8, no. 1, pp. 99-118, 1977.
18. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Science, 7(2): 95-132, 1974.
19. R. Moore, Interval Analysis. Prentice Hall, 1966.
20. A. Neumaier. Interval methods for systems of equations. Cambridge University Press, 1990.
21. W.J. Older and A. Velino. Extending prolog with constraint arithmetic on real intervals. In Proc. of IEEE Canadian conference on Electrical and Computer En- gineering. IEEE Computer Society Press, 1990.
22. W. Older and A. Vellino. Constraint arithmetic on real intervals. in Con- straint Logic Programming: Selected Research, eds., Frèdèric Benhamou and Alain Colmerauer. MIT Press, (1993).
23. Prologia PrologIV Constraints inside. Parc technologique de Luminy - Case 919 13288 Marseille cedex 09 (France), 1996.
24. M. Rueher, C. Solnon. Concurrent Cooperating Solvers within the Reals. Reliable Computing. Kluwer Academic Publishers, Vol.3:3, pp. 325-333, 1997.
25. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
26. P. Van Hentenryck, Y. Deville, and L. Michel. Numerica. A modeling language for global optimization. MIT Press, 1997.
27. P. Van Hentenryck, D. McAllester, and D. Kapur. Solving Polynomial Systems Using a Branch and Prune Aprroach. SIAM Journal (forthcomming).