Results 1 - 10 of 390

Learning for Dynamic Subsumption

by Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs
"... This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses from the formula that can be reduced by subsumption. During the learnt clause derivation, and at each step of the associat ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
subsumption technique within the state-of-the-art SAT solvers Minisat and Rsat particularly benefits to crafted problems. 1.

Company Learning for Dynamic Subsumption

by Youssef Hamadi, Saïd Jabbour, Lakhdar Saïs , 2010
"... This paper presents an original dynamic subsumption technique for Boolean CNF formulae. It exploits simple and sufficient conditions to detect, during conflict analysis, clauses from the formula that can be reduced by subsumption. During the learnt clause derivation, and at each step of the associat ..."
Abstract - Add to MetaCart
subsumption technique within the state-of-the-art SAT solvers Minisat and Rsat particularly benefits to crafted problems.

Faster FDR Counterexample Generation Using SAT-Solving

by H. Palikareva, J. Ouaknine, A. W. Roscoe , 2009
"... With the flourishing development of efficient SAT-solvers, bounded model checking (BMC) has proven to be an extremely powerful symbolic model checking technique. In this paper, we address the problem of applying BMC to concurrent systems involving the interaction of multiple processes running in pa ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
our bounded refinement-checking algorithm which is based on watchdog transformations and incremental SAT-solving. We have implemented a tool, SymFDR, written in C++ which uses FDR as a shared library for manipulating CSP processes and the state-of-the-art SAT-solver MiniSAT. Experiments indicate

Sat7 – Engineering a Modular SAT-Solver

by Christian Kern, Mohammad Khaleghi, Stefan Kugele, Christian Schallhart, Michael Tautschnig, Andreas Weis
"... As many other SAT-solvers are developed in an artful but monolithic style, we took interest in the question whether it is possible to design and implement a modular SAT-solver in a well-engineered and modular way. In particular, we are developing a framework which allows to exchange and adapt variou ..."
Abstract - Add to MetaCart
As many other SAT-solvers are developed in an artful but monolithic style, we took interest in the question whether it is possible to design and implement a modular SAT-solver in a well-engineered and modular way. In particular, we are developing a framework which allows to exchange and adapt

Planning as heuristic search,

by Blai Bonet , Héctor Geffner - 5 – 33, ISSN , 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract - Cited by 421 (33 self) - Add to MetaCart
Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting

Building State-of-the-Art SAT Solvers

by Inês Lynce , João Marques-Silva , 2002
"... Abstract. The area of Propositional Satisfiability (SAT) has been the subject of intensive research in recent years, with significant theoretical and practical contributions. From a practical perspective, a large number of very effective SAT solvers have recently been proposed, most of which based ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
on improvements made to the original Davis-Putnam-Logemann-Loveland (DPLL) backtrack search SAT algorithm. The new solvers are capable of solving very large, very hard real-world problem instances, which more traditional SAT solvers are totally incapable of. Despite the significant improvements in state-of-the-art

Building State-of-the-Art SAT Solvers

by unknown authors
"... Abstract. The area of Propositional Satisfiability (SAT) has been the subject of intensive research in recent years, with significant theoretical and practical contributions. From a practical perspective, a large number of very effective SAT solvers have recently been proposed, most of which based o ..."
Abstract - Add to MetaCart
on improvements made to the original Davis-Putnam-Logemann-Loveland (DPLL) backtrack search SAT algorithm. The new solvers are capable of solving very large, very hard real-world problem instances, which more traditional SAT solvers are totally incapable of. Despite the significant improvements in state-of-the-art

Efficient Conflict Driven Learning in a Boolean Satisfiability Solver

by Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz - In ICCAD , 2001
"... One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine th ..."
Abstract - Cited by 348 (8 self) - Add to MetaCart
One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re

An Extensible SAT-solver [ver 1.2]

by Niklas Een, Niklas Sörensson , 2003
"... In this article, we present a small, complete, and ecient SAT-solver in the style of conict-driven learning, as exempli ed by CHAFF. We aim to give sucient details about implementation to enable the reader to construct his or her own solver in a very short time. This will allow users of SAT-sol ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
to make domain speci c extensions or adaptions of current state-of-the-art SAT-techniques, to meet the needs of a particular application area. The presented solver is designed with this in mind, and includes among other things a mechanism for adding arbitrary boolean constraints. It also supports

ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers

by Fangzhen Lin, Yuting Zhao - Artificial Intelligence , 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one-to-one corresp ..."
Abstract - Cited by 260 (7 self) - Add to MetaCart
experimental results show that in these domains, for the task of generating one answer set of a normal logic program, our system has a clear edge over the state-of-art answer set programming systems Smodels and DLV. 1 1
Results 1 - 10 of 390