Results 21 to 30 of about 494,310 (275)
SAT Solving Using XOR-OR-AND Normal Forms [PDF]
Mathematics and Computer Science, 2023 This paper introduces the XOR-OR-AND normal form (XNF) for logical formulas. It is a generalization of the well-known Conjunctive Normal Form (CNF) where literals are replaced by XORs of literals.
Bernhard Andraschko +2 more
semanticscholar +1 more source
Animated Logic: Correct Functional Conversion to Conjunctive Normal Form [PDF]
CoRR, 2020 We present an approach to obtain formally verified implementations of classical Computational Logic algorithms. We choose the Why3 platform because it allows to implement functions in a style very close to the mathematical definitions, as well as it allows a high degree of automation in the verification process.
Pedro Barroso +2 more
openaire +2 more sources
Learning Explainable Decision Rules via Maximum Satisfiability
IEEE Access, 2020 Decision trees are a popular choice for providing explainable machine learning, since they make explicit how different features contribute towards the prediction.
Henrik E. C. Cao +2 more
doaj +1 more source
Boosting Intelligent Data Analysis in Smart Sensors by Integrating Knowledge and Machine Learning
Sensors, 2021 The presented paper proposes a hybrid neural architecture that enables intelligent data analysis efficacy to be boosted in smart sensor devices, which are typically resource-constrained and application-specific.
Piotr Łuczak +5 more
doaj +1 more source
Extracting verified decision procedures: DPLL and Resolution [PDF]
Logical Methods in Computer Science, 2015 This article is concerned with the application of the program extraction technique to a new class of problems: the synthesis of decision procedures for the classical satisfiability problem that are correct by construction.
Ulrich Berger +3 more
doaj +1 more source
The Complexity of Rooted Phylogeny Problems [PDF]
Logical Methods in Computer Science, 2011 Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where the literals are rooted triples, is there a rooted binary tree that ...
Manuel Bodirsky, Jens K Mueller
doaj +1 more source
Algebraic Persistent Fault Analysis of SKINNY_64 Based on S_Box Decomposition
Entropy, 2022 Algebraic persistent fault analysis (APFA), which combines algebraic analysis with persistent fault attacks, brings new challenges to the security of lightweight block ciphers and has received widespread attention since its introduction.
Xing Fang +5 more
doaj +1 more source
Local Redundancy in SAT: Generalizations of Blocked Clauses [PDF]
Logical Methods in Computer Science, 2018 Clause-elimination procedures that simplify formulas in conjunctive normal form play an important role in modern SAT solving. Before or during the actual solving process, such procedures identify and remove clauses that are irrelevant to the solving ...
Benjamin Kiesl +3 more
doaj +1 more source
Deep Graph Learning for Circuit Deobfuscation
Frontiers in Big Data, 2021 Circuit obfuscation is a recently proposed defense mechanism to protect the intellectual property (IP) of digital integrated circuits (ICs) from reverse engineering.
Zhiqian Chen +8 more
doaj +1 more source
Homomorphisms of conjunctive normal forms
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources