On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
From MaRDI portal
Publication:5015594
DOI10.3233/SAT190102zbMath1484.68222MaRDI QIDQ5015594
Inês Lynce, Ruben Martins, Saurabh Joshi, Vasco M. Manquinho
Publication date: 9 December 2021
Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time transformation of linear inequalities into conjunctive normal form
- Boolean lexicographic optimization: algorithms \& applications
- Curriculum-based course timetabling with SAT and MaxSAT
- An overview of parallel SAT solving
- Cardinality networks: a theoretical and empirical study
- Iterative and core-guided maxsat solving: a survey and assessment
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Efficient SAT Solving under Assumptions
- Improvements to Core-Guided Binary Search for MaxSAT
- Incremental QBF Solving by DepQBF
- Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information
- Cores in Core Based MaxSat Algorithms: An Analysis
- Open-WBO: A Modular MaxSAT Solver,
- Incremental Encoding and Solving of Cardinality Constraints
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- New Encodings of Pseudo-Boolean Constraints into CNF
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- Solving the incremental satisfiability problem
- Theory and Applications of Satisfiability Testing
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- Unsatisfiability-based optimization in clasp
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
