HIS: hierarchical solver for over-constrained satisfaction problems

Authors:
Zerrin Yumak;Tatyana Yakhno
Affiliations:
Department of Computer Engineering, Dokuz Eylul University, Izmir, Turkey;Department of Computer Engineering, Dokuz Eylul University, Izmir, Turkey
Venue:
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Year:
2005

Citing 4
Cited 0

Constraint hierarchies

OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
An incremental constraint solver

Communications of the ACM
Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Ultraviolet: A Constraint Satisfaction Algorithm for InteractiveGraphics

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.