Results 31 to 40 of about 246,520 (298)
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
Improving WalkSAT for Random 3-SAT Problems [PDF]
Journal of Universal Computer Science, 2020 Stochastic local search (SLS) algorithms are well known for their ability to efficiently find models of random instances of the Boolean satisfiability (SAT) problems.
Huimin Fu, Yang Xu, Shuwei Chen, Jun Liu
doaj +3 more sources
BerkMin: A Fast and Robust Sat-Solver [PDF]
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eugene Goldberg, Yakov Novikov
openaire +3 more sources
A Novel SAT-Based Approach to the Task Graph Cost-Optimal Scheduling Problem [PDF]
, 2010 The Task Graph Cost-Optimal Scheduling Problem consists in scheduling a certain number of interdependent tasks onto a set of heterogeneous processors (characterized by idle and running rates per time unit), minimizing the cost of the entire process. This
Sergio Nocco +3 more
core +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 M. Zbrzezny, Andrzej Zbrzezny
doaj +1 more source
EPiC Series in Computing, 2018 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 +3 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
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
Exploiting Macro-actions and Predicting Plan Length in Planning as Satisfiability [PDF]
, 2011 The use of automatically learned knowledge for a planning domain can significantly improve the performance of a generic planner when solving a problem in this domain. In this work, we focus on the well-known SAT-based approach to planning and investigate
Vallati, Mauro +5 more
core +1 more source
OOPS: Optimized One-Planarity Solver via SAT
Journal of Graph Algorithms and ApplicationsWe present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj +1 more source