An Incremental Hierarchical Constraint Solver
نویسندگان
چکیده
This paper presents an incremental method to solve hierarchies of constraints over nite domains, which borrows techniques developed in intelligent backtracking, and nds locally-predicate-better solutions. A prototype implementation of this method, IHCS, was written in C and can be integrated with diierent programming environments. In particular, with Prolog producing an instance of an HCLP language. Possible applications of IHCS are brieey illustrated with a time-tabling and a set covering problem. Because of its portability and incremental nature, IHCS is well suited for reactive systems, allowing the interactive introduction and removal of preferred constraints 1 .
منابع مشابه
Defeasibility in CLP(Q) through Generalized Slack Variables
This paper presents a defeasible constraint solver for the domain of linear equations, disequations and inequalities over the body of rational/real numbers. As extra requirements resulting from the incorporation of the solver into an Incremental Hierarchical Constraint Solver (IHCS) scenario we identiied: a)the ability to refer to individual constraints by a label, b) the ability to report the ...
متن کاملA Plug-In Architecture of Constraint Hierarchy Solvers1
Constraint hierarchies have been proposed to overcome over-constrained systems of constraints by specifying constraints with hierarchical preferences. They are widely used in HCLP (Hierarchical Constraint Logic Programming) – an extension of CLP (Constraint Logic Programming) to include constraint hierarchies, CIP (Constraint Imperative Programming) – an integration of declarative constraint pr...
متن کاملPlug-In Architecture of Constraint Hierarchy Solvers1
Constraint hierarchies have been proposed to overcome over-constrained systems of constraints by specifying constraints with hierarchical preferences. They are widely used in HCLP (Hierarchical Constraint Logic Programming) – an extension of CLP (Constraint Logic Programming) to include constraint hierarchies, CIP (Constraint Imperative Programming) – an integration of declarative constraint pr...
متن کاملHouria Iii: a Solver for Hierarchical Systems of Functional Constraints. Planning the Solution Graph for a Weighted Sum Criterion
Constraints allow programmers and users to state declaratively a relation that should be maintained, rather than requiring them to write procedures to maintain the relation themselves. They are thus useful in many applications such as user interface and simulation packages. In many situations, it is desirable to be able to state both hard and soft constraints. The hard constraints must hold, an...
متن کاملDynamic and Hierarchical Constraints Solver with Continuous Variables
Research in the area of layout, graphics, computer-aided design (CAD), and visualization includes novel techniques of artificial intelligence discipline, to express problems in terms of numeric constraint satisfaction problem over continuous domains. However, in those applications, a constraints solver must support both functional and nonfunctional constraints, and must find a solution even in ...
متن کامل