Sciweavers

142 search results - page 6 / 29
» On-the-Fly Clause Improvement
Sort
View
AAAI
2010
13 years 5 months ago
Exploiting QBF Duality on a Circuit Representation
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
Alexandra Goultiaeva, Fahiem Bacchus
CONSTRAINTS
2011
13 years 2 months ago
Cardinality Networks: a theoretical and empirical study
We introduce Cardinality Networks, a new CNF encoding of cardinality constraints. It improves upon the previously existing encodings such as the sorting networks of [8] in that it ...
Roberto Asín, Robert Nieuwenhuis, Albert Ol...
IMCSIT
2010
13 years 5 months ago
German subordinate clause word order in dialogue-based CALL.
We present a dialogue system for exercising the German subordinate clause word order. The pedagogical methodology we adopt is based on focused tasks: the targeted linguistic struct...
Magdalena Wolska, Sabrina Wilske
AIMSA
1990
Springer
13 years 11 months ago
Compilation of Recursive Two-Literal Clauses into Unification Algorithms
: Automated deduction systems can considerably be improved by replacing axioms with special purpose inference mechanisms. For example replacing in resolution based systems certain ...
Hans Jürgen Ohlbach
DAC
2005
ACM
13 years 9 months ago
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
HoonSang Jin, Fabio Somenzi