Results 31 to 40 of about 42,931 (182)
Using Sat solvers for synchronization issues in partial deterministic automata [PDF]
, 2019 We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver.
A Roman +32 more
core +1 more source
On the Predictability of Classical Propositional Logic
Information, 2013 In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction,
Poliana M. Reis, Marcelo Finger
doaj +1 more source
Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract ...
Francois Hantry, Mohand-Said Hacid
doaj +1 more source
On the van der Waerden numbers w(2;3,t) [PDF]
, 2014 We present results and conjectures on the van der Waerden numbers w(2;3,t) and on the new palindromic van der Waerden numbers pdw(2;3,t). We have computed the new number w(2;3,19) = 349, and we provide lower bounds for 20
Ahmed, Tanbir +2 more
core +2 more sources
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking
International Journal of Interactive Multimedia and Artificial Intelligence, 2015 We present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method
Agnieszka M. Zbrzezny, Andrzej Zbrzezny
doaj +1 more source
EasyChair Preprints, 2018 In this paper we present new implementation details and benchmarking results for our parallel portfolio solver \topo. In particular, we discuss ideas and implementation details for the exchange of learned clauses in a massively-parallel SAT solver which is designed to run more that 1,000 solver threads in parallel.
Thorsten Ehlers, Dirk Nowotka
openaire +2 more sources
A Hybrid Learnt Clause Evaluation Algorithm for SAT Problem
International Journal of Computational Intelligence Systems, 2018 It is of great theoretical and practical significance to develop the efficient SAT solvers due to its important applications in hardware and software verifications and so on, and learnt clauses play the crucial role in state of the art SAT solvers.
Guanfeng Wu +3 more
doaj +1 more source
Survey-propagation decimation through distributed local computations [PDF]
, 2005 We discuss the implementation of two distributed solvers of the random K-SAT problem, based on some development of the recently introduced survey-propagation (SP) algorithm.
Achlioptas D Ricci-Tersenghi F +11 more
core +2 more sources
EPiC Series in Computing, 2019 In this paper we present new implementation details and benchmarking results for our parallel portfolio solver TopoSAT2. In particular, we discuss ideas and implementation details for the exchange of learned clauses in a massively-parallel SAT solver which is designed to run more that 1, 000 solver threads in parallel.
Thorsten Ehlers, Dirk Nowotka
openaire +2 more sources
HordeSat: A Massively Parallel Portfolio SAT Solver
, 2015 A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution.
Balyo, Tomas +2 more
core +1 more source