Results 1 - 10 of 249

BerkMin: a fast and robust sat-solver

by Evgueni Goldberg, Yakov Novikov , 2002
"... We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time BerkMin introduces a new decision making procedure and a new method of clause database management. We experimentally compare ..."
Abstract - Cited by 284 (5 self) - Add to MetaCart
compare BerkMin with Chaff, the leader among SAT-solvers used in the EDA domain. Experiments show that our solver is more robust than Chaff. BerkMin solved all the instances we used in experiments including very large CNFs from a microprocessor verification benchmark suite. On the other hand, Chaff

Hard and Easy Distributions of SAT Problems

by David Mitchell, Bart Selman, Hector Levesque , 1992
"... We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to ..."
Abstract - Cited by 255 (20 self) - Add to MetaCart
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible

Conflict-driven answer set solving

by Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub - in Proceedings IJCAI’07 , 2007
"... We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased ..."
Abstract - Cited by 201 (48 self) - Add to MetaCart
constraintbased framework for the different kinds of inferences in ASP. It also allows us to apply advanced techniques from the areas of CSP and SAT. We have implemented our approach in the new ASP solver clasp. Our experiments show that the approach is competitive with state-of-the-art ASP solvers. 1

On solving the Partial MAX-SAT problem

by Zhaohui Fu, Sharad Malik - In International Conference on Theory and Applications of Satisfiability Testing (SAT’06), LNCS 4121 , 2006
"... Abstract. Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be required/preferable to use variations of the general SAT problem. In this paper, we consider one importan ..."
Abstract - Cited by 79 (1 self) - Add to MetaCart
of the solution. We discuss the relative strengths and thus applicability of the two solvers for different solution scenarios. Further, we show how both techniques benefit from the persistent learning techniques of incremental SAT. Experiments using practical instances of this problem show significant

Sat solving for argument filterings

by Michael Codish, Vitaly Lagoon, René Thiemann, Jürgen Giesl - In Logic for Programming, Artificial Intelligence and Reasoning (LPAR , 2006
"... Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for termination analysis of term rewrite systems based on the dependency pair method. We address two main inter-related issues a ..."
Abstract - Cited by 17 (9 self) - Add to MetaCart
and encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (1) the combined search for a lexicographic path order together with an argument filtering to orient a set of inequalities; and (2) how the choice of the argument filtering influences the set

Using Vampire to reason with OWL

by Dmitry Tsarkov, Re Riazanov, Sean Bechhofer, Ian Horrocks - In Proc. of the 2004 International Semantic Web Conference (ISWC , 2004
"... Abstract. OWL DL corresponds to a Description Logic (DL) that is a fragment of classical first-order predicate logic (FOL). Therefore, the standard methods of automated reasoning for full FOL can potentially be used instead of dedicated DL reasoners to solve OWL DL reasoning tasks. In this paper we ..."
Abstract - Cited by 32 (1 self) - Add to MetaCart
Abstract. OWL DL corresponds to a Description Logic (DL) that is a fragment of classical first-order predicate logic (FOL). Therefore, the standard methods of automated reasoning for full FOL can potentially be used instead of dedicated DL reasoners to solve OWL DL reasoning tasks. In this paper we

Using DNA to Solve SAT

by Richard Lipton
"... : We show how to use DNA experiments to solve the famous "SAT" problem of Computer Science. This is a special case of a more general method of [3] to solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA based computing. It has the potential to ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
: We show how to use DNA experiments to solve the famous "SAT" problem of Computer Science. This is a special case of a more general method of [3] to solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA based computing. It has the potential

SCIP: solving constraint integer programs

by Tobias Achterberg , 2009
"... Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques. In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs), wh ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
Constraint integer programming (CIP) is a novel paradigm which integrates constraint programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and solving techniques. In this paper we discuss the software framework and solver SCIP (Solving Constraint Integer Programs

D.: Faster SAT solving with better CNF generation

by Benjamin Chambers, Panagiotis Manolios, Daron Vroon - In: Proceedings of Design, Automation and Test in Europe (DATE 2009 , 2009
"... Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encoded using arbitrary Boolean expressions, but to use modern SAT solvers, one has to generate expressions in Conjunctive Norma ..."
Abstract - Cited by 9 (1 self) - Add to MetaCart
Normal Form (CNF). This process can significantly affect SAT solving times. In this paper, we introduce a new linear-time CNF generation algorithm. We have implemented our algorithm and have conducted extensive experiments, which show that our algorithm leads to faster SAT solving times and smaller CNF

SAT Modulo Linear Arithmetic for Solving Polynomial Constraints

by Cristina Borralleras, Salvador Lucas, Albert Oliveras, Enric Rodríguez-carbonell, Albert Rubio
"... Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints ba ..."
Abstract - Cited by 12 (4 self) - Add to MetaCart
Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints
Results 1 - 10 of 249