Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Solving Hierarchical Constraints over Finite Domains with Local Search

Solving Hierarchical Constraints over Finite Domains with Local Search Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Solving Hierarchical Constraints over Finite Domains with Local Search

Download PDF
19 pages

Loading next page...
 
/lp/springer-journals/solving-hierarchical-constraints-over-finite-domains-with-local-search-0udjpyCDie

References (16)

Publisher
Springer Journals
Copyright
Copyright © 2004 by Kluwer Academic Publishers
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/B:AMAI.0000012870.93810.37
Publisher site
See Article on Publisher Site

Abstract

Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Oct 5, 2004

There are no references for this article.