New Tableau Characterizations for Non-clausal MaxSAT Problem-Reference-Cited by-同舟云学术

New Tableau Characterizations for Non-clausal MaxSAT Problem

Published:2021-03-08 Issue: Volume: Page:
ISSN:1367-0751
Container-title:Logic Journal of the IGPL
language:en
Short-container-title:

Author:

Fiorino Guido¹

Affiliation:

1. DISCO, Università degli Studi di Milano-Bicocca, Viale Sarca, 336, 20126 Milano, Italy

Abstract

Abstract In this paper, we provide non-clausal tableau calculi for the maximum satisfiability problem and its variants. We discuss both basic calculi to characterize the problem and their modifications to reduce the proof size.

Publisher

Oxford University Press (OUP)

Subject

Logic

Link

http://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzab012/36510418/jzab012.pdf

Reference16 articles.

1. SMT technology for many-valued logics;Ansótegui;Multiple-Valued Logic and Soft Computing,2015

2. MinSAT versus maxSAT for optimization Problems;Argelich,2013

3. Many-valued minSAT solving;Argelich,2014

4. Clause tableaux for maximum and minimum satisfiability;Argelich;Logic Journal of the IGPL,2021

5. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition;Dechter;Artificial Intelligence,1990

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MaxSAT resolution for regular propositional logic;International Journal of Approximate Reasoning;2023-11

2. A Tableau Calculus for Signed Maximum Satisfiability;2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL);2023-05

3. Clausal Forms in MaxSAT and MinSAT;International Journal of Computational Intelligence Systems;2022-11-11

4. Inference in MaxSAT and MinSAT;The Logic of Software. A Tasting Menu of Formal Methods;2022