New Tableau Characterizations for Non-clausal <scp>MaxSAT</scp> Problem
From MaRDI portal
Publication:5092559
DOI10.1093/jigpal/jzab012zbMath1494.03074OpenAlexW3137140266MaRDI QIDQ5092559
Publication date: 22 July 2022
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzab012
Logic in computer science (03B70) Proof theory in general (including proof-theoretic semantics) (03F03) Computational aspects of satisfiability (68R07)
Related Items (1)
This page was built for publication: New Tableau Characterizations for Non-clausal <scp>MaxSAT</scp> Problem