AbsCon: A Prototype to Solve CSPs with Abstraction

  • Authors:
  • Sylvain Merchez;Christophe Lecoutre;Frédéric Boussemart

  • Affiliations:
  • -;-;-

  • Venue:
  • CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.