CCLS: an efficient local search algorithm for weighted maximum satisfiability
The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has
extensive applications. Weighted MAX-SAT instances encoded from real-world applications …
extensive applications. Weighted MAX-SAT instances encoded from real-world applications …
[HTML][HTML] Local search for boolean satisfiability with configuration checking and subscore
This paper presents and analyzes two new efficient local search strategies for the Boolean
Satisfiability (SAT) problem. We start by proposing a local search strategy called …
Satisfiability (SAT) problem. We start by proposing a local search strategy called …
[HTML][HTML] CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability
Weighted maximum satisfiability and (unweighted) partial maximum satisfiability (PMS) are
two significant generalizations of maximum satisfiability (MAX-SAT), and weighted partial …
two significant generalizations of maximum satisfiability (MAX-SAT), and weighted partial …
[HTML][HTML] The configurable SAT solver challenge (CSSC)
It is well known that different solution strategies work well for different types of instances of
hard combinatorial problems. As a consequence, most solvers for the propositional …
hard combinatorial problems. As a consequence, most solvers for the propositional …
Beyond pairwise testing: Advancing 3-wise combinatorial interaction testing for highly configurable systems
To meet the rising demand for software customization, highly configurable software systems
play key roles in practice. Combinatorial interaction testing (CIT) is recognized as an …
play key roles in practice. Combinatorial interaction testing (CIT) is recognized as an …
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 …
Clause states based configuration checking in local search for satisfiability
Two-mode stochastic local search (SLS) and focused random walk (FRW) are the two most
influential paradigms of SLS algorithms for the propositional satisfiability (SAT) problem …
influential paradigms of SLS algorithms for the propositional satisfiability (SAT) problem …
Double configuration checking in stochastic local search for satisfiability
Stochastic local search (SLS) algorithms have shown effectiveness on satisfiable instances
of the Boolean satisfiability (SAT) problem. However, their performance is still unsatisfactory …
of the Boolean satisfiability (SAT) problem. However, their performance is still unsatisfactory …
Solving the t-Wise Coverage Maximum Problem via Effective and Efficient Local Search-Based Sampling
To meet the increasing demand for customized software, highly configurable systems
become essential in practice. Such systems offer many options to configure, and ensuring …
become essential in practice. Such systems offer many options to configure, and ensuring …
LS-sampling: an effective local search based sampling approach for achieving high t-wise coverage
There has been a rapidly increasing demand for developing highly configurable software
systems, which urgently calls for effective testing methods. In practice, t-wise coverage has …
systems, which urgently calls for effective testing methods. In practice, t-wise coverage has …