Sciweavers

160 search results - page 5 / 32
» Satisfiability-Based Algorithms for Boolean Optimization
Sort
View
AAAI
1998
14 years 11 months ago
Learning Evaluation Functions for Global Optimization and Boolean Satisfiability
This paper describes STAGE, a learning approach to automatically improving search performance on optimization problems.STAGElearns an evaluation function which predicts the outcom...
Justin A. Boyan, Andrew W. Moore
CADE
2005
Springer
15 years 10 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
SAT
2004
Springer
113views Hardware» more  SAT 2004»
15 years 3 months ago
Clause Form Conversions for Boolean Circuits
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
Paul Jackson, Daniel Sheridan
SAT
2007
Springer
95views Hardware» more  SAT 2007»
15 years 4 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
ERSHOV
2003
Springer
15 years 3 months ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...