[BOOK][B] Handbook of satisfiability
“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …
applied areas such as planning, scheduling, operations research and combinatorial …
Toward intelligent training of supervised image classifications: directing training data acquisition for SVM classification
GM Foody, A Mathur - Remote Sensing of Environment, 2004 - Elsevier
Conventional approaches to training a supervised image classification aim to fully describe
all of the classes spectrally. To achieve a complete description of each class in feature …
all of the classes spectrally. To achieve a complete description of each class in feature …
Translating pseudo-boolean constraints into SAT
N Eén, N Sörensson - Journal on Satisfiability, Boolean …, 2006 - content.iospress.com
In this paper, we describe and evaluate three different techniques for translating pseudo-
boolean constraints (linear constraints over boolean variables) into clauses that can be …
boolean constraints (linear constraints over boolean variables) into clauses that can be …
Proof complexity and SAT solving
This chapter gives an overview of proof complexity and connections to SAT solving, focusing
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …
Equality saturation: a new approach to optimization
Optimizations in a traditional compiler are applied sequentially, with each optimization
destructively modifying the program to produce a transformed program that is then passed to …
destructively modifying the program to produce a transformed program that is then passed to …
Iterative and core-guided MaxSAT solving: A survey and assessment
Abstract Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real
world applications can be naturally encoded as such. Solving MaxSAT is an important …
world applications can be naturally encoded as such. Solving MaxSAT is an important …
Pseudo-Boolean and cardinality constraints
O Roussel, V Manquinho - Handbook of satisfiability, 2021 - ebooks.iospress.nl
Pseudo-Boolean and cardinality constraints are a natural generalization of clauses. While a
clause expresses that at least one literal must be true, a cardinality constraint expresses that …
clause expresses that at least one literal must be true, a cardinality constraint expresses that …
[PDF][PDF] Divide and Conquer: Towards Faster Pseudo-Boolean Solving.
J Elffers, J Nordström - IJCAI, 2018 - it.uu.se
Divide and Conquer: Towards Faster Pseudo-Boolean Solving Page 1 Divide and Conquer:
Towards Faster Pseudo-Boolean Solving Jan Elffers KTH Royal Institute of Technology …
Towards Faster Pseudo-Boolean Solving Jan Elffers KTH Royal Institute of Technology …
On SAT modulo theories and optimization problems
Abstract Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (eg,
formal hardware and software verification) problems over theories such as the integers …
formal hardware and software verification) problems over theories such as the integers …
Algorithms for weighted boolean optimization
Abstract The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT)
problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent …
problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent …