A decomposition method for CNF minimality proofs
نویسندگان
چکیده
منابع مشابه
A Portfolio Approach for Enforcing Minimality in a Tree Decomposition
Minimality, a highly desirable consistency property of Constraint Satisfaction Problems (CSPs), is in general too expensive to enforce. Previous work has shown the practical benefits of restricting minimality to the clusters of a tree decomposition, allowing us to solve many difficult problems in a backtrack-free manner. We explore two alternative algorithms for enforcing minimality whose perfo...
متن کاملVerification of Proofs of Unsatisfiability for CNF formulas
As SAT-algorithms become more and more complex, there is little chance of writing a SAT-solver that is free of bugs. So it is of great importance to be able to verify the information returned by a SAT-solver. If the CNF formula to be tested is satisfiable, solution verification is trivial and can be easily done by the user. However, in the case of unsatisfiability, the user has to rely on the r...
متن کاملDecomposition of stability proofs for hybrid systems
The verification of hybrid systems, encompassing both discrete-time and continuoustime behavior, is a problem of rising importance. Hybrid behavior occurs wherever a digital system, operating in discrete time, interacts with a real-world environment, which evolves in continuous time. One desired property of hybrid systems is global asymptotic stability. A globally asymptotically stable system c...
متن کاملCompare Adomian Decomposition Method and Laplace Decomposition Method for Burger's-Huxley and Burger's-Fisher equations
In this paper, Adomian decomposition method (ADM) and Laplace decomposition method (LDM) used to obtain series solutions of Burgers-Huxley and Burgers-Fisher Equations. In ADM the algorithm is illustrated by studying an initial value problem and LDM is based on the application of Laplace transform to nonlinear partial differential equations. In ADM only few terms of the expansion are required t...
متن کاملA Novel Method for the Synthesis of CaO Nanoparticle for the Decomposition of Sulfurous Pollutant
In this research, CaO (calcium oxide) nanoparticles were synthesized by Co-Precipitation method in the absence and presence of Polyvinylpyrrolidone (PVP) via using calcium (II) nitrate. The Polyvinylpyrrolidone (PVP) was used as a capping agent to control the agglomeration of the nanoparticles. The synthesized samples were characterized via SEM, XRD and FTIR techniques. The average sizes of nan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.09.016