CNF Application in Discrete
نویسندگان
چکیده
منابع مشابه
PREDICTING THE STIFFNESS OF BIAXIAL BRAIDED FIBER COMPOSITES BY INCORPORATION OF CARBON NANO FIBER
In this study, carbon nano fibers (CNFs) were mixed into epoxy resin through a magnetic stirrer and again mixed using ultra sonicator. Using hand layup technique, biaxial braided fiber composites were prepared with unfilled, 0.2, 0.5 and 1 wt% CNF. Tensile test and shear test was performed to identify the tensile strength and shear strength of the composites. Fractured surface of the tensile sp...
متن کاملEfficient CNF Encoding of Boolean Cardinality Constraints
In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardi...
متن کاملApplication of Discrete Crack in Nonlinear Dynamic Analysis of Shahid Rajaee Arch Dam
the nonlinear discrete crack modeling of Shahid Rajaee thin arch dam is considered. The interface elements are positioned such that certain potential separated blocks can form possible failure mechanisms. The dynamic stability of theses blocks are investigated by a special finite element program "MAP-73" which its nonlinear algorithm and interface elements formulation are presented.
متن کاملBoolean functions with a simple certificate for CNF complexity
In this paper we study relationships between CNF representations of a given Boolean function f and essential sets of implicates of f . It is known that every CNF representation and every essential set must intersect. Therefore the maximum number of pairwise disjoint essential sets of f provides a lower bound on the size of any CNF representation of f . We are interested in functions, for which ...
متن کاملMaximum Renamable Horn sub-CNFs
The NP-hard problem of finding the largest renamable Horn sub-CNF of a given CNF is considered, and a polynomial time approximation algorithm is presented for this problem. It is shown that for cubic CNFs this algorithm has a guaranteed performance ratio of 40 67 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002