HIS: Hierarchical solver for over-constrained satisfaction problems

Yumak Z., Yakhno T.

ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS, cilt.3949, ss.194-202, 2006 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 3949
  • Basım Tarihi: 2006
  • Dergi Adı: ARTIFICIAL INTELLIGENCE AND NEURAL NETWORKS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Compendex, EMBASE, MathSciNet, Philosopher's Index, zbMATH
  • Sayfa Sayıları: ss.194-202
  • Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

Constraint programming is an approach for solving mostly combinatorial problems by declaratively describing the problem and using special solving algorithms. Restrictions called constraints are stated over the problem variables that reduces the values each variable can take. In some cases it is not possible to satisfy all constraints or the user can state some preferences on them. One of the techniques to solve this kind of problems is modelling and solving the problem as a constraint hierarchy. This paper describes a hierarchical constraint solver HIS, which is developed in C++ using ILOG Solver as an ordinary constraint solver. HIS is based on refining algorithm. As an application a layout problem is considered.