Article thumbnail

Domain consistency with forbidden values

By Yves Deville, Pascal Van Hentenryck and 16th International Conference on Principles and Practice of Constraint Programming (CP 2010)

Abstract

This paper presents a novel domain-consistency algorithm which does not maintain supports dynamically during propagation, but rather maintain forbidden values. It introduces the optimal NAC4 (negative AC4) algorithm based on this idea. It further shows that maintaining forbidden values dynamically allows the generic algorithm AC5 to achieve domain consistency in time O(ed) for classes of constraints in which the number of supports is O(d2) but the number of forbidden values is O(d). The paper also shows how forbidden values and supports can be used jointly to achieve domain consistency on logical combinations of constraints and to compute validity as well as entailment of constraints. Experimental results show the benefits of the joint exploitation of supports and forbidden values

Topics: 1160, QA75
Year: 2010
OAI identifier: oai:dial.uclouvain.be:boreal:87138
Provided by: DIAL UCLouvain
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2078.1/8... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles