Distance constraints in constraint satisfaction

Authors:
Emmanuel Hebrard;Barry O'Sullivan;Toby Walsh
Affiliations:
4C, Computer Science Dept., UCC, Ireland;4C, Computer Science Dept., UCC, Ireland;NICTA and UNSW, Sydney, Australia
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 6
Cited 5

Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
DISTANCE-SAT: complexity and algorithms

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems

Constraints
Finding diverse and similar solutions in constraint programming

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
Algorithms for the maximum hamming distance problem

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints

A Soft Constraint of Equality: Complexity and Approximability

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A BDD Approach to the Feature Subscription Problem

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Finding Similar or Diverse Solutions in Answer Set Programming

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Reasoning about optimal collections of solutions

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Hybrid search for minimal perturbation in Dynamic CSPs

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Users can often naturally express their preferences in terms of ideal or non-ideal solutions. We show how to reason about logical combinations of distance constraints on ideals and non-ideals using a novel global constraint. We evaluate our approach on both randomly generated and real-world configuration problem instances.