Results 1 - 10 of 94

Lynx: A Programmatic SAT Solver for the RNA-folding Problem

by Vijay Ganesh, Charles W. O’donnell, Mate Soos, Srinivas Devadas, Martin Rinard, O Solar-lezama
"... Abstract. This paper introduces Lynx, an incremental programmatic SAT solver that allows non-expert users to easily introduce domain-specific code into modern Conflict-driven Clause-learning (CDCL) SAT solvers, thus enabling users to control the behavior of the solver in ways not possible otherwise. ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. This paper introduces Lynx, an incremental programmatic SAT solver that allows non-expert users to easily introduce domain-specific code into modern Conflict-driven Clause-learning (CDCL) SAT solvers, thus enabling users to control the behavior of the solver in ways not possible otherwise

Temporal Induction by Incremental SAT Solving

by Niklas Een, Niklas Sörensson , 2003
"... We show how a very modest modi cation to a typical modern SAT-solver enables it to solve a series of related SAT-instances eciently. ..."
Abstract - Cited by 92 (2 self) - Add to MetaCart
We show how a very modest modi cation to a typical modern SAT-solver enables it to solve a series of related SAT-instances eciently.

Existential Quantification as Incremental SAT

by Jörg Brauer, Andy King, Jael Kriener - In Twenty-third International Conference on Computer Aided Verification, G. Gopalakrishnan and
"... Abstract. This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing a ..."
Abstract - Cited by 18 (7 self) - Add to MetaCart
Abstract. This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing

Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

by Clark W. Barrett, David L. Dill, Aaron Stump - IN PROC. OF THE COMPUTER AIDED VERICATION (CAV'02), LNCS , 2002
"... In the past few years, general-purpose propositional satisfiability (SAT) solvers have improved dramatically in performance and have been used to tackle many new problems. It has also been shown that certain simple fragments of first-order logic can be decided efficiently by first translating the pr ..."
Abstract - Cited by 98 (12 self) - Add to MetaCart
In the past few years, general-purpose propositional satisfiability (SAT) solvers have improved dramatically in performance and have been used to tackle many new problems. It has also been shown that certain simple fragments of first-order logic can be decided efficiently by first translating

Incremental Compilation-to-SAT Procedures

by Marco Benedetti, Sara Bernardini - In: Seventh International Conference on Theory and Applications of Satisfiability Testing , 2004
"... Abstract. We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework that encompasses all the aspects of an incremental decision procedure, from the encoding to the incremental so ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
Abstract. We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework that encompasses all the aspects of an incremental decision procedure, from the encoding to the incremental

Analyzing Context-Free Grammars Using an Incremental SAT Solver

by Keijo Heljanko, Martin Lange
"... Abstract. We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some finite length: inclusion, intersection, universality, equivalence, and ambiguity. These are in (co)-NP and thus solvable by a reduction to the (un-)satisfiability pr ..."
Abstract - Add to MetaCart
-)satisfiability problem for propositional logic. We present such encodings – fully utilizing the power of incrementat SAT solvers – prove correctness and validate this approach with benchmarks. 1

Incremental SAT Seminar Satisfiability Checking

by Christian Hans, Supervision Gereon Kremer, Rwth Aachen
"... Abstract. Nadel et. al. propose Ultimately Incremental SAT (UI-SAT), an algorithm for incremental SAT solving under assumptions. After solving a formula, incremental SAT solving under assumptions allows to reinvoke the SAT solver with additional clauses added to the problem. At the same time, assump ..."
Abstract - Add to MetaCart
Abstract. Nadel et. al. propose Ultimately Incremental SAT (UI-SAT), an algorithm for incremental SAT solving under assumptions. After solving a formula, incremental SAT solving under assumptions allows to reinvoke the SAT solver with additional clauses added to the problem. At the same time

Incremental Cardinality Constraints for MaxSAT

by Ruben Martins, Saurabh Joshi, Vasco Manquinho, Ines Lynce
"... Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental i ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental

Incremental Cardinality Constraints for MaxSAT‡

by unknown authors
"... Abstract. Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incr ..."
Abstract - Add to MetaCart
Abstract. Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental

Asynchronous Multi-Core Incremental SAT Solving

by Siert Wieringa, Keijo Heljanko
"... Abstract. Solvers for propositional logic formulas, so called SAT solvers, are used in many practical applications. As multi-core and multi-processor hard-ware has become widely available, parallelizations of such solvers are actively researched. Such research typically ignores the incremental probl ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. Solvers for propositional logic formulas, so called SAT solvers, are used in many practical applications. As multi-core and multi-processor hard-ware has become widely available, parallelizations of such solvers are actively researched. Such research typically ignores the incremental
Results 1 - 10 of 94