Results 101 to 110 of about 20,200 (225)
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits [PDF]
, 2015 For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable.
Schwerdtfeger, Konrad W.
core
ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY
Prikladnaya Diskretnaya Matematika, 2020 Summary: Generic-case approach to algorithmic problems was suggested by \textit{I. Kapovich} et al. [J. Algebra 264, No. 2, 665--694 (2003; Zbl 1041.20021)]. This approach studies behavior of an algorithm on typical (almost all) inputs and ignores the rest of inputs. In [Prikl. Diskretn. Mat. 2017, No.
openaire +1 more source
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
, 2011 This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers.
Dixon, H. E. +2 more
core +1 more source
IET Cyber-Physical Systems: Theory &Applications, Volume 10, Issue 1, January/December 2025.This article presents a novel approach to compositional reasoning and verification using quantifier elimination (QE) as a foundational calculus. We introduce a framework that derives the strongest system‐level property from component‐level properties and their interconnections, applicable to both time‐independent and time‐dependent properties.
Hao Ren, Ratnesh Kumar
wiley +1 more source
On Propositional Encoding of Distinction Property in Finite Sets
Известия Иркутского государственного университета: Серия "Математика", 2019 In the paper we describe a new propositional encoding procedure for the property that all objects comprising some finite set are distinct. For the considered class of combinatorial problems it is sufficient to represent the elements of such set by their ...
E. G. Beley, A. A. Semenov
doaj +1 more source
Improve SAT-solving with Machine Learning
, 2017 In this project, we aimed to improve the runtime of Minisat, a Conflict-Driven Clause Learning (CDCL) solver that solves the Propositional Boolean Satisfiability (SAT) problem.
Wu, Haoze
core +1 more source
Superposition‐Based Abstractions for Quantum Data Encoding Verification
IET Quantum Communication, Volume 6, Issue 1, January/December 2025.This work presents a novel verification approach that addresses a critical gap in quantum computing research‐the verification of quantum data encoding. A verification methodology capable of verifying quantum circuits with more than 8000 qubits in less than one second achieving both efficiency and scalability is introduced.
Arun Govindankutty +1 more
wiley +1 more source
MULTIPLE FOLDING OF REGULAR STRUCTURES VIA SOLVING LOGIC EQUATIONS
Informatika, 2016 The problem under consideration is to reduce the area of the layout of regular VLSI structures by means of their multiple folding. The method of solving the key problem of multiple folding, which is implementability checking of the folding set, is ...
L. D. Cheremisinova
doaj
On the Complexity of the Numerically Definite Syllogistic and Related Fragments
, 2007 In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently
Boole +11 more
core +1 more source
Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks
Frontiers in Genetics, 2018 Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data
Stalin Muñoz +7 more
doaj +1 more source