Maintaining reversible DAC for Max-CSP
نویسندگان
چکیده
منابع مشابه
Reversible DAC and Other Improvements for Solving Max-CSP
Following the work of R. Wallace on Max-CSP, later improved by J. Larrosa and P. Meseguer, we tested a number of possible improvements of the usage of directed arc consistency for the partial forward checking algorithm (PFC). The main improvement consists in exploiting a non standard form of DAC, called reversible DAC where each constraint is exploited in a direction which is not necessarily de...
متن کاملModelling Max-CSP as Partial Max-SAT
We define a number of original encodings that map MaxCSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding...
متن کاملImproved Algorithms for Sparse MAX-SAT and MAX-k-CSP
We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)· 2n(1−μ) for – μ = Ω( 1 c ) and polynomial space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 √ c ) and exponential space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 ck2 ) and polynomial space solving MAX-k-...
متن کاملUsing Max-CSP techniques for software diagnosis
In computing systems programming is essential to provide efficient software diagnosis tools to help programmers to locate bugs. Our approach takes into account the source code and pre/post asserts. According to this specification we generate a constraints model which constitutes a Max-CSP. The set of wrong statements in a program can be detected with this constraints model.
متن کاملA Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In this paper, inspired from the concept of inferred disjunctive constraints introduced by Freuder and Hubbe, we show that it is possible to exploit the arc-inconsistency counts, associated with each value of a network, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(98)00108-8