Conflict-driven clause learning SAT solvers
One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …
problems has been the introduction of clause learning. Clause learning entails adding a …
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 …
Maximum satisfiabiliy
Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …
Core-boosted linear search for incomplete MaxSAT
Abstract Maximum Satisfiability (MaxSAT), the optimisation extension of the well-known
Boolean Satisfiability (SAT) problem, is a competitive approach for solving NP-hard …
Boolean Satisfiability (SAT) problem, is a competitive approach for solving NP-hard …
Anytime weighted MaxSAT with improved polarity selection and bit-vector optimization
A Nadel - 2019 Formal Methods in Computer Aided Design …, 2019 - ieeexplore.ieee.org
This paper introduces a new anytime algorithm for Weighted MaxSAT consisting of two main
algorithmic components. First, we propose a new efficient polarity selection heuristic and an …
algorithmic components. First, we propose a new efficient polarity selection heuristic and an …
Maximum satisfiability in software analysis: Applications and techniques
A central challenge in software analysis concerns balancing different competing tradeoffs.
To address this challenge, we propose an approach based on the Maximum Satisfiability …
To address this challenge, we propose an approach based on the Maximum Satisfiability …
Algorithms for computing backbones of propositional formulae
The problem of propositional satisfiability (SAT) has found a number of applications in both
theoretical and practical computer science. In many applications, however, knowing a …
theoretical and practical computer science. In many applications, however, knowing a …
[HTML][HTML] Minimal sets on propositional formulae. Problems and reductions
Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem.
Progress in SAT solving algorithms has motivated an ever increasing number of practical …
Progress in SAT solving algorithms has motivated an ever increasing number of practical …
Effective post-silicon validation of system-on-chips using quick error detection
This paper presents the Quick Error Detection (QED) technique for systematically creating
families of post-silicon validation tests that quickly detect bugs inside processor cores and …
families of post-silicon validation tests that quickly detect bugs inside processor cores and …
[HTML][HTML] Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
J Berg, M Järvisalo - Artificial Intelligence, 2017 - Elsevier
Integration of the fields of constraint solving and data mining and machine learning has
recently been identified within the AI community as an important research direction with high …
recently been identified within the AI community as an important research direction with high …