A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
On Incremental Core-Guided MaxSAT Solving
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
This paper aims to improve the efficiency of unsat coreguided MaxSAT solving on a sequence of similar problem instances. ...
Our approach is akin to the well-known idea of incremental SAT solving. ...
This reflects an inherent challenge to making core-guided MaxSAT solving incremental 6 : for a MaxSAT instance formed with two disjoint sets of clauses φ and δ, solving φ followed by φ ∪ δ, rather than ...
doi:10.1007/978-3-319-44953-1_30
fatcat:ryzynklnyvdphi4jpbt7peinlm
MSCG: Robust Core-Guided MaxSAT Solving
2015
Journal on Satisfiability, Boolean Modeling and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This work describes and evaluates the Maximum Satisfiability using the Core-Guided approach solver (MSCG), which is a robust MaxSAT solver that participated in the MaxSAT Evaluation 2014. ...
Maximum Satisfiability (MaxSAT) is a well-known optimization version of Propositional Satisfiability (SAT) that finds a wide range of practical applications. ...
MaxSAT Algorithms MSCG gathers different core-guided MaxSAT algorithms. ...
doi:10.3233/sat190105
fatcat:qknmu5fs2fhypjamqinn4sb6nq
Improvements to Core-Guided Binary Search for MaxSAT
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In addition, the paper proposes two additional novel techniques, which can be implemented on top of core-guided MaxSAT algorithms that maintain both lower and upper bounds. ...
Motivated by practical applications, recent years have seen the development of core-guided algorithms for MaxSAT. ...
Section 2 introduces the MaxSAT problem and core-guided binary search MaxSAT algorithms. ...
doi:10.1007/978-3-642-31612-8_22
fatcat:wdw33xz4lfab7dgusiguy4hnwq
SAT-based Preprocessing for MaxSAT (extended version)
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Furthermore, we show that MaxSAT algorithms restated in the framework have a natural implementation on top of an incremental SAT solver. ...
Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. ...
To illustrate the idea consider the pseudocode of a core-guided algorithm for solving partial MaxSAT problem due to Fu and Malik [10] , presented in Figure 4 .1. ...
arXiv:1310.2298v2
fatcat:qdzuhlwygvazfeberc4rh3zjhi
Incremental Cardinality Constraints for MaxSAT
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Other Versions
These results suggest that incremental cardinality constraints could be beneficial for other constraint solving domains. ...
Many of these algorithms are non-incremental in nature, i.e. at each iteration the formula is rebuilt and no knowledge is reused from one iteration to another. ...
and MSU3 core-guided algorithm. ...
doi:10.1007/978-3-319-10428-7_39
fatcat:cjn55eryfvhtpj4dh7sxk66zle
A Modular Approach to MaxSAT Modulo Theories
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We have implemented our approach on top of the MATHSAT5 SMT solver and of a selection of external MaxSAT solvers, and we have evaluated it by means of an extensive empirical test on SMT-LIB benchmarks. ...
In this paper we present a novel "modular" approach for (weighted partial) MaxSAT Modulo Theories. ...
Finally, core-guided solvers, such as e.g. ...
doi:10.1007/978-3-642-39071-5_12
fatcat:bxawrqwspzfl3gkekblwifqo44
RC2: an Efficient MaxSAT Solver
2019
Journal on Satisfiability, Boolean Modeling and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Based on this fact and motivated by the ideas underlying the PySAT toolkit, this paper describes and evaluates RC2 (stands for relaxable cardinality constraints), a new core-guided MaxSAT solver written ...
Maximum satisfiability (MaxSAT) is a well-known optimization version of SAT, which can be solved with a series of calls to a SAT oracle. ...
Incremental MaxSAT Solving Besides the features described above, RC2 also supports incremental MaxSAT solving. ...
doi:10.3233/sat190116
fatcat:3ecpgboo6rbk7mepq7rqjetluy
Incomplete MaxSAT Approaches for Combinatorial Testing
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Similarly, we show how to solve through MaxSAT technology a closely related problem, the Tuple Number problem, which we extend to incorporate constraints. ...
The extensive experimental evaluation we carry out on the available Mixed Covering Arrays with Constraints benchmarks and the comparison with state-of-the-art tools confirm the good performance of our ...
Acknowledgements We would like to thank specially Akihisa Yamada for the access to several benchmarks for our experiments and solving some questions about his previous work on Combinatorial Testing with ...
arXiv:2105.12552v1
fatcat:ubel4fr7qjhwtaoyfuh65xsd6i
MaxSAT-Based MCS Enumeration
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Nevertheless, in practical MaxSAT solving, the MSU3 algorithm is not as effective as other core-guided MaxSAT algorithms. ...
Current state of the art MCS enumeration exploits core-guided MaxSAT algorithms, namely the so-called MSU3 [16] MaxSAT algorithm. ...
MSU3 is a core-guided MaxSAT algorithm (once that it relies on unsatisfiable cores) that iteratively improves a lower bound. ...
doi:10.1007/978-3-642-39611-3_13
fatcat:hmcgzz6f4bgrxfqfqur6za5gxe
On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
2015
Journal on Satisfiability, Boolean Modeling and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In recent years, unsatisfiability-based algorithms have become prevalent as state of the art for solving industrial instances of Maximum Satisfiability (MaxSAT). ...
Furthermore, we also propose to extend incrementality to weighted MaxSAT through an incremental encoding of pseudo-Boolean constraints. ...
Linear search Sat-Unsat algorithms [31, 33] are implemented incrementally. A critical issue is on keeping safe learned clauses in successive iterations of a core-guided algorithm [44] . ...
doi:10.3233/sat190102
fatcat:4dzjdjr2bvckhpn3a2wrvstmmm
A Core-Guided Approach to Learning Optimal Causal Graphs
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We propose several domain-specific techniques and integrate them into a core-guided maximum satisfiability solver, thereby speeding up current state of the art in exact search for causal graphs with cycles ...
and latent confounders on simulated and real-world data. ...
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence ...
doi:10.24963/ijcai.2017/90
dblp:conf/ijcai/HyttinenSJ17
fatcat:t6q2jl75uvanpkyp6b2xg5ng7q
Maximum Satisfiability in Software Analysis: Applications and Techniques
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Enabling these applications on real-world programs necessitates solving large MaxSAT instances comprising over 10 30 clauses in a sound and optimal manner. ...
To address this challenge, we propose an approach based on the Maximum Satisfiability (MaxSAT) problem, an optimization extension of the Boolean Satisfiability (SAT) problem. ...
We propose an incremental MaxSAT solving technique [60] to solve the sequential MaxSAT problem more efficiently. ...
doi:10.1007/978-3-319-63387-9_4
fatcat:5d7clvdjwzbi5ffgmbworrztni
Quantified Maximum Satisfiability:
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
More significantly, the core-guided approach also outperforms the state-of-the-art SMUS extractor Digger. ...
The other approach, which is the main contribution of the paper, is inspired by recent work on MaxSAT, and exploits the iterative identification of unsatisfiable cores. ...
The second approach represents the main contribution of this paper, and is inspired by recent work on core-guided MaxSAT, i.e. solving MaxSAT by iteratively computing unsatisfiable subformulas [19] . ...
doi:10.1007/978-3-642-39071-5_19
fatcat:ttogujuhorf6bcf54ahwdkv2le
SAT-Based Approaches to Treewidth Computation: An Evaluation
2014
2014 IEEE 26th International Conference on Tools with Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Marques-Silva, “Improvements to core-
Networks, vol. 40, no. 3, pp. 170–180, 2002. guided binary search for MaxSAT,” in Proc. SAT, ser. ...
The experiments were performed on a cluster of 2.8-GHz
3) Using MaxSAT solvers to find an optimal solution to Intel Xeon quad core machines with 32-GB memory and
Fmax (G). ...
doi:10.1109/ictai.2014.57
dblp:conf/ictai/BergJ14
fatcat:pcjlnsh4cvcqbnbb4zaelcadx4
νZ - An Optimizing SMT Solver
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It allows users to pose and solve optimization problems modulo theories. ...
of approaches for solving linear optimization problems over SMT formulas, MaxSMT, and their combinations. ...
MaxRes increments a lower bound when there is an unsatisfiable core of the soft constraints. ...
doi:10.1007/978-3-662-46681-0_14
fatcat:wvqr3cehtvfujlr4evckb37fru
« Previous
Showing results 1 — 15 out of 179 results