منابع مشابه
Arc Consistency and Friends
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc consistency, a heavily investigated inference method, and three extensions thereof from the perspective of constraint languages. We conduct a comparison of the studied...
متن کاملArc-Consistency and Arc-Consistency Again
There is no need to show the importance of arc-consistency in Constraint Networks. Mohr and Henderson [8] have proposed AC-4, an algorithm having an optimal worst-case time complexity. But it has two drawbacks: its space complexity and its average time complexity. In problems with many solutions, where the size of the constraints is large, these drawbacks become so important that users often re...
متن کاملArc and Path Consistency Revisited
ARC AND PATH CONSISTENCY REVISITED' Roger Mohr and Thomas C. Henderson 2 CRIN BP 239 54506 Vandoeuvre (France)
متن کاملArc Consistency and Quasigroup Completion
Quasigroup completion is a recently proposed benchmark constraint satisfaction problem that combines the features of randomly generated instances and highly structured problems. A quasigroup completion problem can be represented as a CSP with n 2 variables, each with a domain of size n. The constraints can be represented either by 2n all diierent n-ary constraints or by binary pairwise constrai...
متن کاملArc Consistency in SAT
I describe and study the ‘support encoding’ of binary constraint satisfaction problems (CSP’s) into boolean satisfiability (SAT). This is based on work by Kasif in 1990, in which clauses encode support information, rather than the encoding of conflicts in the standard ‘direct encoding’. This enables arc consistency in the original CSP to be established by propagation in the translated SAT insta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2011
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exr039