Peek arc consistency

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Peek arc consistency

This paper studies peek arc consistency, a reasoning technique that extends the wellknown arc consistency technique for constraint satisfaction. In contrast to other more costly extensions of arc consistency that have been studied in the literature, peek arc consistency requires only linear space and quadratic time and can be parallelized in a straightforward way such that it runs in linear tim...

متن کامل

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 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...

متن کامل

Maintaining Singleton Arc-Consistency

Singleton Arc-Consistency (SAC) [7] is a simple and strong level of consistency but is costly to enforce. To date, research has focused on improving the performance of algorithms that achieve SAC, and comparing algorithms as a preprocessing step before actually solving a problem. Here, we show for the first time how a basic SAC algorithm can be readily incorporated into an open source constrain...

متن کامل

Extending Dual Arc Consistency

Comparisons between primal and dual approaches have recently been extensively studied and evaluated from a theoretical standpoint based on the amount of pruning achieved by each of these when applied to non-binary constraint satisfaction problems. Enforcing arc consistency on the dual encoding has been shown to strictly dominate enforcing GAC on the primal encoding (Stergiou & Walsh 1999). More...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2010

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2009.07.059