A proof builder for Max-SAT
From MaRDI portal
Publication:2118341
DOI10.1007/978-3-030-80223-3_33OpenAlexW3185606021MaRDI QIDQ2118341
Mohamed Sami Cherif, Djamal Habet, Matthieu Py
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_33
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (2)
Uses Software
Cites Work
- Near optimal seperation of tree-like and general resolution
- Resolution for Max-SAT
- Equivalence between systems stronger than resolution
- Towards a better understanding of (partial weighted) MaxSAT proof systems
- A Near-Optimal Separation of Regular and General Resolution
- Open-WBO: A Modular MaxSAT Solver,
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- The Complexity of Propositional Proofs
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- RC2: an Efficient MaxSAT Solver
- Unsatisfiability-based optimization in clasp
- A Machine-Oriented Logic Based on the Resolution Principle
- A Complete Calculus for Max-SAT
- Principles and Practice of Constraint Programming – CP 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A proof builder for Max-SAT