\(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
From MaRDI portal
Publication:2009185
DOI10.1007/s10601-018-9299-0zbMath1483.68244OpenAlexW2909188079WikidataQ128567790 ScholiaQ128567790MaRDI QIDQ2009185
Miyuki Koshimura, Hiroshi Fujita, Aolong Zha
Publication date: 27 November 2019
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-018-9299-0
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (3)
An incremental SAT-based approach for solving the real-time taxi-sharing service problem ⋮ Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time transformation of linear inequalities into conjunctive normal form
- SAT-based MaxSAT algorithms
- Cardinality networks: a theoretical and empirical study
- Solving weighted CSP by maintaining arc consistency
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- PySAT: a Python toolkit for prototyping with SAT oracles
- Coalition structure generation for partition function games utilizing a concise graphical representation
- Principles and practice of constraint programming. 21st international conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015. Proceedings
- Improvements to Core-Guided Binary Search for MaxSAT
- Optimal Base Encodings for Pseudo-Boolean Constraints
- Pairwise Cardinality Networks
- A New Look at BDDs for Pseudo-Boolean Constraints
- Simplifying Pseudo-Boolean Constraints in Residual Number Systems
- Planning and Scheduling by Logic-Based Benders Decomposition
- Towards Robust CNF Encodings 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
- Exploiting the Power of mip Solvers in maxsat
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- The complexity of theorem-proving procedures
- On Solving the Partial MAX-SAT Problem
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
