Results 1 to 10 of about 494,310 (275)
A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form [PDF]
Entropy, 2021 The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot.
Zaijun Zhang, Daoyun Xu, Jincheng Zhou
doaj +7 more sources
The Incremental Satisfiability Problem for a Two Conjunctive Normal Form [PDF]
Electronic Notes in Theoretical Computer Science, 2016 Abstract We propose a novel method to review K ⊢ ϕ when K and ϕ are both in Conjunctive Normal Forms (CF). We extend our method to solve the incremental satisfiablity problem (ISAT), and we present different cases where ISAT can be solved in polynomial time. Especially, we present an algorithm for 2-ISAT.
Guillermo De Ita Luna +1 more
exaly +6 more sources
Quality measures for fuzzy predicates in conjunctive and disjunctive normal forms [PDF]
Ingeniería e Investigación, 2014 Association rule mining is a very popular data mining technique. Rules in this technique are often used to identify and represent de-pendencies between attributes in databases.
Taymi Ceruto Cordovés +2 more
doaj +7 more sources
On Variables with Few Occurrences in Conjunctive Normal Forms [PDF]
CoRR, 2011 We consider the question of the existence of variables with few occurrences in boolean conjunctive normal forms (clause-sets). Let mvd(F) for a clause-set F denote the minimal variable-degree, the minimum of the number of occurrences of variables. Our main result is an upper bound mvd(F) <= nM(surp(F)) <= surp(F) + 1 + log_2(surp(F)) for lean ...
Oliver Kullmann, Xishun Zhao
semanticscholar +9 more sources
Bridging Data Models in Health Care With a Novel Intermediate Query Format for Feasibility Queries: Mixed Methods Study [PDF]
JMIR Medical InformaticsBackgroundTo advance research with clinical data, it is essential to make access to the available data as fast and easy as possible for researchers, which is especially challenging for data from different source systems within and across institutions ...
Lorenz Rosenau +5 more
doaj +2 more sources
Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing [PDF]
Nature CommunicationsThe Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by
Haesol Im +16 more
doaj +2 more sources
On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
Discrete Applied Mathematics, 1999 Let f:{0,1}n→{0,1} be a monotone Boolean function whose value at any point x∈{0,1}n can be determined in time t. Denote by the irredundant CNF of f, where C is the set of the prime implicates of f. Similarly, let be the irredundant DNF of the same function, where D is the set of the prime implicants of f.
V Gurvich, L Khachiyan
exaly +3 more sources
Same Effect Relation and Concept Reduction in Formal Concept Analysis [PDF]
Jisuanji kexue, 2023 Since 2018,scholars have proposed and studied a new topic of “concept reduction” in formal concept analysis.Including unnecessary concepts,core concepts,relatively necessary concepts,and the identification of three types of concepts,and research on ...
MA Wensheng, HOU Xilin
doaj +1 more source
Advances in Evolutionary Optimization of Quantum Operators
Mendel, 2021 A comparative study is presented regarding the evolutionary design of quantum operators in the form of unitary matrices.A comparative study is presented regarding the evolutionary design of quantum operators in the form of unitary matrices.
Petr Žufan, Michal Bidlo
doaj +3 more sources
Symmetries in Modal Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example, hybrid logics ...
Carlos Areces +2 more
doaj +1 more source