Results 61 to 70 of about 20,200 (225)
Using Boinc Desktop Grid To Solve Large Scale Sat Problems
Computer Science, 2012 Many practically important combinatorial problems can be efficiently reducedto a problem of Boolean satisfiability (SAT). Therefore, the implementation ofdistributed algorithms for solving SAT problems is of great importance. In thisarticle we describe a
Mikhail Posypkin +2 more
doaj +1 more source
Model Abstraction for Discrete-Event Systems Using a SAT Solver
IEEE Access, 2023 Model abstraction for finite state automata is beneficial to reduce the complexity of discrete-event systems (DES), enhance the readability and facilitate the control synthesis and verification of DES.
Lihong Cheng, Lei Feng
doaj +1 more source
Generalizing Boolean Satisfiability III: Implementation
, 2011 This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers.
Dixon, H. E. +4 more
core +1 more source
Satisfiability Modulo Theory based Methodology for Floorplanning in VLSI Circuits
, 2017 This paper proposes a Satisfiability Modulo Theory based formulation for floorplanning in VLSI circuits. The proposed approach allows a number of fixed blocks to be placed within a layout region without overlapping and at the same time minimizing the ...
Banerjee, Suchandra +2 more
core +1 more source
Complexity classifications for different equivalence and audit problems for Boolean circuits [PDF]
, 2012 We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types ...
Elmar Böhler +6 more
core +4 more sources
SAT-Based Counterexample-Guided Inductive Synthesis of Distributed Controllers
IEEE Access, 2020 This article proposes a new method for automatic synthesis of distributed discrete-state controllers from given temporal specification and behavior examples.
Konstantin Chukharev +3 more
doaj +1 more source
Term-Level Reasoning in Support of Bit-blasting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 GL is a verified tool for proving ACL2 theorems using Boolean methods such as BDD reasoning and satisfiability checking. In its typical operation, GL recursively traverses a term, computing a symbolic object representing the value of each subterm.
Sol Swords
doaj +1 more source
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC [PDF]
, 2010 The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms.
Meier, Arne, Schneider, Thomas
core +1 more source
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Intermediate problems in modular circuits satisfiability
, 2020 In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfiability over algebras from congruence modular varieties.
David +5 more
core +1 more source