符号最大可满足性的一个表演算

2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL) Pub Date : 2023-05-01 DOI:10.1109/ISMVL57333.2023.00041

Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, F. Manyà

{"title":"符号最大可满足性的一个表演算","authors":"Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, F. Manyà","doi":"10.1109/ISMVL57333.2023.00041","DOIUrl":null,"url":null,"abstract":"We define a tableau calculus for solving the Maximum Satisfiability Problem for propositional signed formulas (Signed MaxSAT) and prove its soundness and completeness. We also describe how it can be naturally extended when we distinguish between hard and soft signed formulas.","PeriodicalId":419220,"journal":{"name":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Tableau Calculus for Signed Maximum Satisfiability\",\"authors\":\"Shuolin Li, Jordi Coll, Djamal Habet, Chu Min Li, F. Manyà\",\"doi\":\"10.1109/ISMVL57333.2023.00041\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define a tableau calculus for solving the Maximum Satisfiability Problem for propositional signed formulas (Signed MaxSAT) and prove its soundness and completeness. We also describe how it can be naturally extended when we distinguish between hard and soft signed formulas.\",\"PeriodicalId\":419220,\"journal\":{\"name\":\"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)\",\"volume\":\"128 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL57333.2023.00041\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL57333.2023.00041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们定义了一个求解命题有符号公式最大可满足性问题(signed MaxSAT)的表演算，并证明了它的正确性和完备性。当我们区分硬符号和软符号公式时，我们还描述了它是如何自然扩展的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Tableau Calculus for Signed Maximum Satisfiability

We define a tableau calculus for solving the Maximum Satisfiability Problem for propositional signed formulas (Signed MaxSAT) and prove its soundness and completeness. We also describe how it can be naturally extended when we distinguish between hard and soft signed formulas.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL)

自引率

0.00%

发文量