Results 41 to 50 of about 3,379,264 (310)
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
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 Zbrzezny, Andrzej Zbrzezny
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
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
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
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
Proteus: A Hierarchical Portfolio of Solvers and Transformations
, 2014 In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving
B.A. Huberman +11 more
core +1 more source
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
Scientific Reports, 2022 Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their ...
Hiroki Oshiyama, Masayuki Ohzeki
doaj +1 more source
Exploiting Resolution-based Representations for MaxSAT Solving
, 2015 Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas.
A Gelder Van +16 more
core +1 more source