Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
40
views
26
references
Top references
cited by
16
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,235
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing - SAT 2009: 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings
Algorithms for Weighted Boolean Optimization
other
Author(s):
Vasco Manquinho
,
Joao Marques-Silva
,
Jordi Planes
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
26
Record
: found
Abstract
: not found
Article
: not found
Paths, trees, and flowers
Jack Edmonds
(1965)
0
comments
Cited
375
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A linear-time transformation of linear inequalities into conjunctive normal form
Joost P. Warners
(1998)
0
comments
Cited
26
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
On Solving the Partial MAX-SAT Problem
Zhaohui Fu
,
Sharad Malik
(2006)
0
comments
Cited
26
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 495-508
DOI:
10.1007/978-3-642-02777-2_45
SO-VID:
ef8fd15b-0a2c-4a2b-973d-e7e3221d9fe6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms
pp. 2
Symbolic Techniques in Propositional Satisfiability Solving
pp. 4
Efficiently Calculating Evolutionary Tree Measures Using SAT
pp. 18
Finding Lean Induced Cycles in Binary Hypercubes
pp. 32
Finding Efficient Circuits Using SAT-Solvers
pp. 45
Encoding Treewidth into SAT
pp. 51
The Complexity of Reasoning for Fragments of Default Logic
pp. 65
Does Advice Help to Prove Propositional Tautologies?
pp. 73
Backdoors in the Context of Learning
pp. 80
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
pp. 86
On Some Aspects of Mixed Horn Formulas
pp. 101
Variable Influences in Conjunctive Normal Forms
pp. 114
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
pp. 128
An Exponential Lower Bound for Width-Restricted Clause Learning
pp. 141
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
pp. 147
Boundary Points and Resolution
pp. 161
Sequential Encodings from Max-CSP into Partial Max-SAT
pp. 167
Cardinality Networks and Their Applications
pp. 181
New Encodings of Pseudo-Boolean Constraints into CNF
pp. 195
Efficient Term-ITE Conversion for Satisfiability Modulo Theories
pp. 209
On-the-Fly Clause Improvement
pp. 223
Dynamic Symmetry Breaking by Simulating Zykov Contraction
pp. 237
Minimizing Learned Clauses
pp. 244
Extending SAT Solvers to Cryptographic Problems
pp. 258
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
pp. 265
A Theoretical Analysis of Search in GSAT
pp. 276
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
pp. 284
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
pp. 298
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques
pp. 312
Restart Strategy Selection Using Machine Learning Techniques
pp. 326
Instance-Based Selection of Policies for SAT Solvers
pp. 341
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
pp. 356
Problem-Sensitive Restart Heuristics for the DPLL Procedure
pp. 363
(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms
pp. 377
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
pp. 391
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
pp. 398
A Compact Representation for Syntactic Dependencies in QBFs
pp. 412
Beyond CNF: A Circuit-Based QBF Solver
pp. 427
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
pp. 441
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
pp. 447
Relaxed DPLL Search for MaxSAT
pp. 453
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
pp. 467
Exploiting Cycle Structures in Max-SAT
pp. 481
Generalizing Core-Guided Max-SAT
pp. 495
Algorithms for Weighted Boolean Optimization
pp. 509
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
pp. 524
c-sat: A Parallel SAT Solver for Clusters
Similar content
4,235
Fixed-points in Random Boolean Networks: The impact of parallelism in the scale-free topology case
Authors:
Pablo de Espanés
,
Ivan Rapaport
,
Axel Osses
Harmonizing Medicine and Surgery in the Pursuit of Boolean Remission: A Rheumatological Magnum Opus
Authors:
Abdur Rehman
,
Jinal Choudhari
,
Abdullah Shehryar
…
A single-layer platform for Boolean logic and arithmetic through DNA excision in mammalian cells
Authors:
Benjamin Weinberg
,
N. Hang Pham
,
Leidy Caraballo
…
See all similar
Cited by
16
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
Authors:
Jessica E. Davies
,
Fahiem Bacchus
Open-WBO: A Modular MaxSAT Solver,
Authors:
Ruben Martins
,
Vasco Manquinho
,
Inês Lynce
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Authors:
Alessandro Cimatti
,
Anders Franzén
,
Alberto Griggio
…
See all cited by