Results 1  10
of
2,078
Propositional Satisfiability
, 2005
"... One of the key traits that distinguish intelligent beings is their ability to reason about the world based on acquired knowledge. In our quest for autonomy, where artificial agents have to operate in complex environments and make decisions without external intervention, such reasoning abilities are ..."
Abstract
 Add to MetaCart
One of the key traits that distinguish intelligent beings is their ability to reason about the world based on acquired knowledge. In our quest for autonomy, where artificial agents have to operate in complex environments and make decisions without external intervention, such reasoning abilities are sometimes necessary. An agent that can acquire knowledge and reason based on such
Propositional Satisfiability: Algorithms and Applications
, 2008
"... In the first part of this paper we survey a number of algorithms for solving the propositional satisfiability problem (SAT). We dedicate a large amount of attention to the nonclausal SAT algorithms, that is, the algorithms that work on arbitrary propositional formulas, and to the circuit SAT algori ..."
Abstract
 Add to MetaCart
In the first part of this paper we survey a number of algorithms for solving the propositional satisfiability problem (SAT). We dedicate a large amount of attention to the nonclausal SAT algorithms, that is, the algorithms that work on arbitrary propositional formulas, and to the circuit SAT
SYNTACTIC CHARACTERIZATION OF PROPOSITIONAL SATISFIABILITY
, 2005
"... The subject of the research reported in this thesis belongs to the area known as Propositional Satisfiability, an area located in the intersection of Theoretical Computer Science, Artificial Intelligence, and Mathematical Logic. In this thesis I show that the set of satisfying truthvalue assignment ..."
Abstract
 Add to MetaCart
The subject of the research reported in this thesis belongs to the area known as Propositional Satisfiability, an area located in the intersection of Theoretical Computer Science, Artificial Intelligence, and Mathematical Logic. In this thesis I show that the set of satisfying truth
Improvements To Propositional Satisfiability Search Algorithms
, 1995
"... ... quickly across a wide range of hard SAT problems than any other SAT tester in the literature on comparable platforms. On a Sun SPARCStation 10 running SunOS 4.1.3 U1, POSIT can solve hard random 400variable 3SAT problems in about 2 hours on the average. In general, it can solve hard nvariable ..."
Abstract

Cited by 174 (0 self)
 Add to MetaCart
... quickly across a wide range of hard SAT problems than any other SAT tester in the literature on comparable platforms. On a Sun SPARCStation 10 running SunOS 4.1.3 U1, POSIT can solve hard random 400variable 3SAT problems in about 2 hours on the average. In general, it can solve hard nvariable random 3SAT problems with search trees of size O(2 n=18:7 ). In addition to justifying these claims, this dissertation describes the most significant achievements of other researchers in this area, and discusses all of the widely known general techniques for speeding up SAT search algorithms. It should be useful to anyone interested in NPcomplete problems or combinatorial optimization in general, and it should be particularly useful to researchers in either Artificial Intelligence or Operations Research.
HeuristicBased Backtracking for Propositional Satisfiability
 Proceedings of the Portuguese Conference on Artificial Intelligence, Vol., 1894 of Lecture Notes in Artificial Intelligence, 2003
"... In recent years backtrack search algorithms for Propositional Satisfiability (SAT) have been the subject of dramatic improvements. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In recent years backtrack search algorithms for Propositional Satisfiability (SAT) have been the subject of dramatic improvements.
Synthesis of Propositional Satisfiability Solvers
, 2008
"... Development of system software by refinement has been extensively studied, and few larger scale case studies has been carried out. Most refinement approaches havse relied on manual construction of adhoc nonreusable refinements that are subjected to posthoc verification. The problem with this appr ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Development of system software by refinement has been extensively studied, and few larger scale case studies has been carried out. Most refinement approaches havse relied on manual construction of adhoc nonreusable refinements that are subjected to posthoc verification. The problem with this approach is that the incremental cost of adapting to changing requirements
Propositional Satisfiability is...
, 2002
"... The SAT problem is the problem of finding a model for a formula in conjunctive normal form. We developed two algorithms based on hyperunit propagation, which solve the SAT problem. Hyperunit propagation is unit propagation simultaneously by literals, as unit clauses, of an assignment. The first me ..."
Abstract
 Add to MetaCart
The SAT problem is the problem of finding a model for a formula in conjunctive normal form. We developed two algorithms based on hyperunit propagation, which solve the SAT problem. Hyperunit propagation is unit propagation simultaneously by literals, as unit clauses, of an assignment. The first method, called UnicornSAT algorithm, solves the resolutionfree SAT problem in linear time. A formula is resolutionfree if and only if there are no two clauses, which differ only in one variable. For such a restricted formula we can find a model in linear time by hyperunit propagation. We obtain a submodel, i.e., a part of the model, by negation of a resolutionmate of a minimal clause, which is a clause with the smallest number of literals in the formula. We obtain a resolutionmate of a clause by negating one literal in it. By hyperunit propagation by a submodel we obtain a formula, which has fewer variables and clauses and remains resolutionfree. Therefore, we can obtain a model by joining the submodels while we perform hyperunit propagation by a submodel recursively until the formula becomes empty. The second method, called GeneralUnicornSAT algorithm, solves the general
A study of Propositional Satisfiability Solvers
, 2007
"... This project consists of a brief survey of the propositional satisfiability problem; including its origins, applied contexts where it has been used, a history of approaches for solving it, and finally, how the method of clause deletion can help in solving instances of propositional SAT. 1 ..."
Abstract
 Add to MetaCart
This project consists of a brief survey of the propositional satisfiability problem; including its origins, applied contexts where it has been used, a history of approaches for solving it, and finally, how the method of clause deletion can help in solving instances of propositional SAT. 1
Reformulating Propositional Satisfiability as Constraint Satisfaction
 Lecture Notes in Computer Science
, 2000
"... . We study how propositional satisfiability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four different mappings of SAT problems into CSPs. For each mapping, we compare theoretically the performance of systematic algorithms like FC and MAC applied to ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. We study how propositional satisfiability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four different mappings of SAT problems into CSPs. For each mapping, we compare theoretically the performance of systematic algorithms like FC and MAC applied
Complete local search for propositional satisfiability
 In proceedings of AAAI
, 2004
"... Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search algorithms are notoriously incomplete: They are not guaranteed to find a feasible solution if one exists and they cannot b ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
be used to determine unsatisfiability. We present an algorithmic framework for complete local search and discuss in detail an instantiation for the propositional satisfiability problem (SAT). The fundamental idea is to use constraint learning in combination with a novel objective function that converges
Results 1  10
of
2,078