On solving the partial MAX-SAT problem
Z Fu, S Malik - International Conference on Theory and Applications of …, 2006 - Springer
Boolean Satisfiability (SAT) has seen many successful applications in various fields such as
Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be …
Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be …
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 …
[HTML][HTML] Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability
Abstract Maximum Satisfiability (MaxSAT) is a basic and important constraint optimization
problem. When dealing with both hard and soft constraints, the MaxSAT problem is referred …
problem. When dealing with both hard and soft constraints, the MaxSAT problem is referred …
MiniMaxSAT: An efficient weighted Max-SAT solver
In this paper we introduce MiniMaxSat, a new Max-SAT solver that is built on top of MiniSat+.
It incorporates the best current SAT and Max-SAT techniques. It can handle hard clauses …
It incorporates the best current SAT and Max-SAT techniques. It can handle hard clauses …
[PDF][PDF] Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT.
Abstract Partial MaxSAT (PMS) generalizes SAT and MaxSAT by introducing hard clauses
and soft clauses. PMS and Weighted PMS (WPMS) have many important real world …
and soft clauses. PMS and Weighted PMS (WPMS) have many important real world …
NuWLS: improving local search for (weighted) partial MaxSAT by new weighting techniques
Abstract Maximum Satisfiability (MaxSAT) is a prototypical constraint optimization problem,
and its generalized version is the (Weighted) Partial MaxSAT problem, denoted as (W) PMS …
and its generalized version is the (Weighted) Partial MaxSAT problem, denoted as (W) PMS …
[PDF][PDF] A MaxSAT algorithm using cardinality constraints of bounded size
Core-guided algorithms proved to be effective on industrial instances of MaxSAT, the
optimization variant of the satisfiability problem for propositional formulas. These algorithms …
optimization variant of the satisfiability problem for propositional formulas. These algorithms …
Automatic Parallelization of Software Network Functions
Software network functions (NFs) trade-off flexibility and ease of deployment for an
increased challenge of performance. The traditional way to increase NF performance is by …
increased challenge of performance. The traditional way to increase NF performance is by …
Tailoring local search for partial MaxSAT
Partial MaxSAT (PMS) is a generalization to SAT and MaxSAT. Many real world problems
can be encoded into PMS in a more natural and compact way than SAT and MaxSAT. In this …
can be encoded into PMS in a more natural and compact way than SAT and MaxSAT. In this …
Optimization of combinatorial testing by incremental SAT solving
Combinatorial testing aims at reducing the cost of software and system testing by reducing
the number of test cases to be executed. We propose an approach for combinatorial testing …
the number of test cases to be executed. We propose an approach for combinatorial testing …