Clause tableaux for maximum and minimum satisfiability

DOI10.1093/JIGPAL/JZZ025OpenAlexW2971244387WikidataQ127703789 ScholiaQ127703789MaRDI QIDQ5018764FDOQ5018764

Authors: Josep Argelich, Chu-Min Li, Felip Manya, Joan Ramon Soler 

Publication date: 22 December 2021

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/jzz025

Recommendations

• A tableau calculus for non-clausal maximum satisfiability
• A non-clausal tableau calculus for \textsc{MinSat}
• New tableau characterizations for non-clausal \textsc{MaxSAT} problem
• A Complete Calculus for Max-SAT
• Resolution for Max-SAT

zbMATH Keywords

completenessMaxSATtableauxcalculusBoolean optimizationMinSAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in computer science (03B70)

Cited In (4)

• A primal-dual approximation algorithm for \textsc{minsat}
• A non-clausal tableau calculus for \textsc{MinSat}
• Extension and equivalence problems for clause minimal formulae
• Title not available (Why is that?)

This page was built for publication: Clause tableaux for maximum and minimum satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018764)