JSAT
2008
13 years 11 months ago
2008
We introduce a new jump strategy for look-ahead based satisfiability (Sat) solvers that aims to boost their performance on satisfiable formulae, while maintaining their behavior o...
FROCOS
2007
Springer
14 years 3 months ago
2007
Springer
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
SAT
2004
Springer
14 years 4 months ago
2004
Springer
We present a scheduler with a web interface for generating fair game schedules of a tournament. The tournament can be either single or double round-robin or something in between. T...
SAT
2004
Springer
14 years 4 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
BIRTHDAY
2005
Springer
14 years 5 months ago
2005
Springer
Propositional reasoning (SAT) is an essential part of many reasoning tasks. Many problems in computer science can be compiled to SAT and then effectively decided using state-of-th...
CP
2007
Springer
14 years 5 months ago
2007
Springer
It has been widely observed that there is no “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional appr...
ICTAI
2008
IEEE
14 years 5 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
CADE
2002
Springer
14 years 11 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
CP
2009
Springer
15 years 2 days ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
DAC
2009
ACM
15 years 13 days ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...