Abstract
In this paper, we present a Java constraint programming prototype called AbsCon which has been conceived to deal with CSP abstraction. AbsCon considers n-ary constraints and implements different value and variable ordering heuristics as well as different propagation methods. As AbsCon exploits object technology, it is easy to extend its functionalities.
This paper has been supported in part by a “contrat de plan Etat-Région Nord/Pasde-Calais” and by the “IUT de Lens”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Bessiere. Non-binary constraints. In Proc. of CP’99, pages 24–27, Alexandria, VA, USA, October 11–14 1999.
C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proc. of CP’99, pages 88–102, Alexandra, VA, 1999.
C. Bessiere and J.C. Regin. Mac and combined heuristics: two reasons to forsake fc (and cbj?) on hard problems. In Proc. of CP’96, Cambridge MA, 1996.
S. Bistarelli, P. Codognet, and F. Rossi. An abstraction framework for soft constraints and its relationship with constraint propagation. In Proc. of SARA’2000, pages 71–86, 2000.
Y. Caseau. Abstract interpretation of constraints on order-sorted domains. In Proc. of the International Symposium on Logic Programming, pages 435–452, 1991.
A. Hon Wai Chun. Constraint programming in Java with JSolver 2.0. Technical report, City university of Hong Kong, 1999.
A. Hon Wai Chun. Waltz filtering in Java with JSolver. In PA Java’99, London, April 1999.
P. Cousot and R. Cousot. Abstract interpretation frameworks. Logic and Computation, 2(4):447–511, August 1992.
Thomas Ellman. Abstraction via approximate symmetry. In Proc. of IJCAI’93, pages 916–921, Chambéry, France, 1993.
D. Frost and R. Dechter. Look-ahead value ordering for constraint satisfaction problems. In Proc. of IJCAI’95, pages 572–578, 1995.
F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 56(2–3):323–390, October 1992.
A. Haralick and G.L. Elliot. Increasing tree search efficienciy for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
ILOG. http://www.ilog.com.
F. Laburthe and the OCRE project team. Choco: implementing a cp kernel. In Actes des 6ème Journées Nationales pour la résolution des Problèmes NP-Complets, 2000.
C. Lecoutre, S. Merchez, F. Boussemart, and E. Grégoire. A csp abstraction framework. In Proc. of SARA’2000, pages 164–184, Lake LBJ, Texas, July 26–29 2000. Springer Verlag. Lecture Notes in Artificial Intelligence (LNAI), volume 1864.
A.K. Mackworh. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
S. Merchez. Constraint Satisfaction Problems: a study of abstraction and hierarchy mecanisms. PhD thesis, Université d’Artois, 2000. In French.
P. Prosser. An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 1996.
P. Roy, A. Liret, and F. Pachet. Implementing Application frameworks: Object-Oriented Frameworks at Work, volume 2(4), chapter Constraint Satisfaction Problems Framework. Wiley & sons, 1999.
B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 1996.
M. Torrens, R. Weigel, and B. Faltings. Distributing problem solving on the web using constraint technology. In Proc. of ICTAI’98, pages 42–49, Taipei, Taiwan (ROC), 1998.
D. Waltz. Understanding line drawings of scenes with shadows, chapter The psychology of computer vision, pages 19–91. Winston (Ed), Mac-Graw Hill, New York, 1975.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Merchez, S., Lecoutre, C., Boussemart, F. (2001). AbsCon: A Prototype to Solve CSPs with Abstraction. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_59
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive