A New Algorithm for Singleton Arc Consistency
نویسندگان
چکیده
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search space by removing as many as possible inconsistent values from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus it achieves even better domain pruning. The paper presents a new algorithm for singleton arc consistency that improves practical time efficiency of singleton arc consistency by applying the principles behind AC-4.
منابع مشابه
Singleton Arc Consistency Revised
Consistency techniques make a main flavour of most constraint satisfaction algorithms. Their goal is to remove as many as possible inconsistencies from the problem. Singleton consistency is a meta-consistency technique that reinforces other pure consistency techniques by their repeated invocation and thus it achieves even better domain pruning. The paper presents a new algorithm for singleton a...
متن کاملA Greedy Approach to Establish Singleton Arc Consistency
In this paper, we propose a new approach to establish Singleton Arc Consistency (SAC) on constraint networks. While the principle of existing SAC algorithms involves performing a breadth-first search up to a depth equal to 1, the principle of the two algorithms introduced in this paper involves performing several runs of a greedy search (where at each step, arc consistency is maintained). It is...
متن کاملOptimal and Suboptimal Singleton Arc Consistency Algorithms
Singleton arc consistency (SAC) enhances the pruning capability of arc consistency by ensuring that the network cannot become arc inconsistent after the assignment of a value to a variable. Algorithms have already been proposed to enforce SAC, but they are far from optimal time complexity. We give a lower bound to the time complexity of enforcing SAC, and we propose an algorithm that achieves t...
متن کاملTheoretical Analysis of Singleton Arc Consistency
Singleton arc consistency (SAC) is a local consistency that enhances the pruning capability of arc consistency by ensuring that the network can be made arc consistent after any assignment of a value to a variable. While some algorithms have been proposed in the literature to enforce SAC, a more in-depth theoretical analysis of this local consistency has never been published. In this paper, we g...
متن کاملUne approche gloutonne pour établir la singleton consistance d ’ arc Stéphane
In this paper, we propose a new approach to establish Singleton Arc Consistency (SAC) on constraint networks. While the principle of existing SAC algorithms involves performing a breadth-first search up to a depth equal to 1, the principle of the two algorithms introduced in this paper involves performing several runs of a greedy search (where at each step, arc consistency is maintained). It is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004