Filters








2,976 Hits in 4.2 sec

Local Redundancy in SAT: Generalizations of Blocked Clauses [article]

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2017 arXiv   pre-print
For this reason, we say that the redundancy property of blocked clauses is local. In this paper, we show that there exist local redundancy properties that are even more general than blocked clauses.  ...  We present a semantic notion of blocking and prove that it constitutes the most general local redundancy property.  ...  We show in this paper that blocked clauses do not constitute the most general concept of a local redundancy property.  ... 
arXiv:1702.05527v2 fatcat:odttjqksrzhctm3fkkvo3wgex4

Efficient distributed SAT and SAT-based distributed Bounded Model Checking

Malay K. Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar
2006 International Journal on Software Tools for Technology Transfer (STTT)  
In this paper, we present: a) a method for distributed-SAT over a network of workstations using a Master/Client model where each client worsktation has an exclusive partition of the SAT problem and uses  ...  For the sake of scalability, at no point in the BMC computation does a single workstation have all the information.  ...  , learnt local clauses, update score request Tasks of a Client C i Table 1 [ 1 a-b].  ... 
doi:10.1007/s10009-005-0203-z fatcat:k5bapu5r4vdgfhr4gy2fa5hhra

Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking [chapter]

Malay K Ganai, Aarti Gupta, Zijiang Yang, Pranav Ashar
2003 Lecture Notes in Computer Science  
In this paper, we present: a) a method for distributed-SAT over a network of workstations using a Master/Client model where each client worsktation has an exclusive partition of the SAT problem and uses  ...  For the sake of scalability, at no point in the BMC computation does a single workstation have all the information.  ...  , learnt local clauses, update score request Tasks of a Client C i Table 1 [ 1 a-b].  ... 
doi:10.1007/978-3-540-39724-3_30 fatcat:7kfwjl2x3zhfpe6odfbtfgodzy

SAT Solving with GPU Accelerated Inprocessing [chapter]

Muhammad Osama, Anton Wijs, Armin Biere
2021 Lecture Notes in Computer Science  
AbstractSince 2013, the leading SAT solvers in the SAT competition all use inprocessing, which unlike preprocessing, interleaves search with simplifications.  ...  It runs in parallel on the GPU to reduce memory consumption and improves memory access locality. Our new parallel variable elimination algorithm is twice as fast as previous work.  ...  SAT solving [44] , and SAT-based test generation [33] .  ... 
doi:10.1007/978-3-030-72016-2_8 fatcat:erjv756cf5brrfzzzbkpjkebkq

Exact DFA Identification Using SAT Solvers [chapter]

Marijn J. H. Heule, Sicco Verwer
2010 Lecture Notes in Computer Science  
Third, we include many redundant clauses to provide the SAT solver with some additional knowledge about the problem.  ...  Fourth, we show how to use the flexibility of our translation in order to apply it to very hard problems.  ...  We will show that these blocked clauses improve the performance of DFA identification. However, for other problems, removal of blocked clauses results in a speed-up [18] .  ... 
doi:10.1007/978-3-642-15488-1_7 fatcat:tqe7pyxd6zhnziocuf6gy57qna

Boolean Equi-propagation for Optimized SAT Encoding [article]

Amit Metodi and Michael Codish and Vitaly Lagoon and Peter J. Stuckey
2011 arXiv   pre-print
Propagation based solving applies this information as a form of partial evaluation resulting in optimized SAT encodings.  ...  We demonstrate for a variety of benchmarks that our approach results in smaller CNF encodings and leads to speed-ups in solving times.  ...  Hence we believe that Boolean equi-propagation, combined with CNF simplification tools (such as SatELite), makes an important contribution to the encoding of CSPs to SAT.  ... 
arXiv:1104.4617v1 fatcat:xtpsd7bohrhojmbw4waeed4rvy

Boolean Equi-propagation for Optimized SAT Encoding [chapter]

Amit Metodi, Michael Codish, Vitaly Lagoon, Peter J. Stuckey
2011 Lecture Notes in Computer Science  
We demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.  ...  This information is then applied as a form of partial evaluation to simplify constraints prior to their encoding as CNF formulae.  ...  '09 and FS'09 (results for lazy clause generation solvers reported in [16] and [9] ).  ... 
doi:10.1007/978-3-642-23786-7_47 fatcat:zo5yhg65ifbtnbdobh2nagzoqi

Efficient Verified (UN)SAT Certificate Checking

Peter Lammich
2019 Journal of automated reasoning  
SAT solvers decide the satisfiability of Boolean formulas in conjunctive normal form. They are commonly used for software and hardware verification.  ...  As a single bug in the solver may invalidate the verification of many systems, SAT solvers output certificates for their answer, which are then checked independently.  ...  , and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s10817-019-09525-z fatcat:hkuphe2mofeq5kvz3lxmo6lnve

Framework for Generating Configurable SAT Solvers

Bernardo C. Vieira, Fabrício V. Andrade, Antônio O. Fernandes
2011 Journal of Integrated Circuits and Systems  
Nevertheless, they might differ in the elimination of learnt clauses, as well as in the decision heuristic. This article presents a framework for generating configurable SAT solvers.  ...  The experiments demonstrate that the first SAT solver generated is a faster solver than state-of-the-art SAT solver BerkMin for several instances as well as for Minisat in almost every instance.  ...  Restarts and clause recording, according to Gomes et al [6] brought SAT solvers in the direction of general resolution, which is considered the main factor of efficiency of SAT solvers in real world  ... 
doi:10.29292/jics.v6i1.338 fatcat:5l2boii4rnalrgibaim4apmxgy

SAT-Based Cooperative Planning: A Proposal [chapter]

Marco Benedetti, Luigia Carlucci Aiello
2005 Lecture Notes in Computer Science  
We discuss in some details both piers of our construction: SAT-based planning techniques and distributed approaches to satisfiability.  ...  Then, we propose how to join them by presenting a working example. 1 In the robotic literature high level goals are more often called "missions," and "mission planning" consists in the decomposition of  ...  Acknowledgements We acknowledge the support of MIUR, the Italian Ministry of Research (Project Moses) and ASI (the Italian Space Agency), that made the research reported in this paper possible.  ... 
doi:10.1007/978-3-540-32254-2_28 fatcat:cmjfn46iuvar7edkvyvepfgrlu

Parallel SAT Simplification on GPU Architectures [chapter]

Muhammad Osama, Anton Wijs
2019 Lecture Notes in Computer Science  
In addition, we have studied the impact of the algorithms on the solvability of problems with Lingeling. We conclude that our algorithms have a considerable impact on the solvability of SAT problems.  ...  Benchmarks show that the algorithms achieve an acceleration of 66× over a state-of-the-art SAT simplifier (SatELite).  ...  The subsumed clause C 1 is redundant and can be deleted from the original SAT equation. A special form of subsumption is called self-subsuming resolution.  ... 
doi:10.1007/978-3-030-17462-0_2 fatcat:yqosvargirhgrgivahhfkj5pay

Heuristics for Planning with SAT [chapter]

Jussi Rintanen
2010 Lecture Notes in Computer Science  
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning.  ...  The strategy is based on generic principles about properties of plans, and its performance with standard planning benchmarks often substantially improves on generic variable selection heuristics used in  ...  of Excellence program.  ... 
doi:10.1007/978-3-642-15396-9_34 fatcat:zovmyaqwsva6joxozsy3g4orke

Beyond the structure of SAT formulas

Jesús Giráldez-Cru
2016 Constraints  
In Glucose, it was proposed to consider the number of decision levels occurring in a learnt clause as a measure of its quality (this was called Literal Block Distance, LBD, lower is better).  ...  In general, this set of techniques is usually named as Conflict-Driven Clause Learn- ing (or CDCL) SAT solvers.  ... 
doi:10.1007/s10601-016-9260-z fatcat:dj2feerovvfwxdk5toynlohcga

Algorithms for the Satisfiability (SAT) Problem [chapter]

Jun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah
1999 Handbook of Combinatorial Optimization  
Schlipf for help in writing some of the text, particularly the sections on the diagnosis of circuit faults, and Binary Decision Diagrams.  ...  In modern SAT solvers, new clauses are generated by resolution steps ordered by the current search tree path.  ...  Assume the general case that no clause is falsified for M 1:i−1 at the beginning of the i th iteration of the final Repeat block.  ... 
doi:10.1007/978-1-4757-3023-4_7 fatcat:y6rqgi5rnfcefkkjfbipduugae

Clause Vivification by Unit Propagation in CDCL SAT Solvers [article]

Chu-Min Li, Fan Xiao, Mao Luo, Felip Manyà, Zhipeng Lü, Yu Li
2018 arXiv   pre-print
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals.  ...  It is worth mentioning that one of the SAT solvers described here was ranked first in the main track of SAT Competition 2017 thanks to the incorporation of the proposed clause vivification.  ...  Acknowledgements We thank Armin Biere for explaining us how clause vivification is implemented in Cadical-2018.  ... 
arXiv:1807.11061v1 fatcat:62njg5tryzhx5e2ctszn2qd7ay
« Previous Showing results 1 — 15 out of 2,976 results