JSAT
2006
13 years 11 months ago
2006
This paper reports about the 2005 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the third in a series of non-competitive events established with the ai...
JSAT
2006
13 years 11 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
JSAT
2006
13 years 11 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
JSAT
2006
13 years 11 months ago
2006
An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
JSAT
2006
13 years 11 months ago
2006
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
JSAT
2006
13 years 11 months ago
2006
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. This algorithm uses the clauseshorte...
JSAT
2006
13 years 11 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...