A proof builder for Max-SAT
From MaRDI portal
Publication:2118341
DOI10.1007/978-3-030-80223-3_33OpenAlexW3185606021MaRDI QIDQ2118341FDOQ2118341
Authors: Matthieu Py, Mohamed Sami Cherif, Djamal Habet
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_33
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07)
Cites Work
- Title not available (Why is that?)
- RC2: an efficient MaxSAT solver
- A Machine-Oriented Logic Based on the Resolution Principle
- The Complexity of Propositional Proofs
- Open-WBO: a modular MaxSAT solver
- New inference rules for Max-SAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Unsatisfiability-based optimization in clasp
- A Complete Calculus for Max-SAT
- Solving Max-SAT as weighted CSP
- Resolution for Max-SAT
- A near-optimal separation of regular and general resolution
- Near optimal seperation of tree-like and general resolution
- Title not available (Why is that?)
- Equivalence between systems stronger than resolution
- Towards a better understanding of (partial weighted) MaxSAT proof systems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: A proof builder for Max-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118341)