Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SAT
2004
Springer
73views Hardware» more  SAT 2004»
10 years 6 months ago
A SAT Based Scheduler for Tournament Schedules
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...
Hantao Zhang, Dapeng Li, Haiou Shen
SAT
2004
Springer
90views Hardware» more  SAT 2004»
10 years 6 months ago
Encoding Global Unobservability for Efficient Translation to SAT
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
Miroslav N. Velev
SAT
2004
Springer
107views Hardware» more  SAT 2004»
10 years 6 months ago
Solving Non-clausal Formulas with DPLL search
Christian Thiffault, Fahiem Bacchus, Toby Walsh
SAT
2004
Springer
111views Hardware» more  SAT 2004»
10 years 6 months ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak
SAT
2004
Springer
85views Hardware» more  SAT 2004»
10 years 6 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
SAT
2004
Springer
106views Hardware» more  SAT 2004»
10 years 6 months ago
The Optimality of a Fast CNF Conversion and its Use with SAT
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
Daniel Sheridan
SAT
2004
Springer
158views Hardware» more  SAT 2004»
10 years 6 months ago
Combining Component Caching and Clause Learning for Effective Model Counting
Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Ka...
SAT
2004
Springer
131views Hardware» more  SAT 2004»
10 years 6 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
SAT
2004
Springer
95views Hardware» more  SAT 2004»
10 years 6 months ago
Local Search for Very Large SAT Problems
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
Steven David Prestwich, Colin Quirke
books