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.
Cite
CITATION STYLE
Merchez, S., Lecoutre, C., & Boussemart, F. (2001). AbsCon: A prototype to solve CSPs with abstraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2239, pp. 730–744). Springer Verlag. https://doi.org/10.1007/3-540-45578-7_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
