基于模块化 SAT 的团队语义推理任务技术

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE

Journal of Computer and System Sciences Pub Date : 2024-07-25 DOI:10.1016/j.jcss.2024.103575

Arnaud Durand , Juha Kontinen , Jouko Väänänen

{"title":"基于模块化 SAT 的团队语义推理任务技术","authors":"Arnaud Durand , Juha Kontinen , Jouko Väänänen","doi":"10.1016/j.jcss.2024.103575","DOIUrl":null,"url":null,"abstract":"<div><p>We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"146 ","pages":"Article 103575"},"PeriodicalIF":1.1000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022000024000709/pdfft?md5=257fe45a7b50d68c8b72d3df843b4963&pid=1-s2.0-S0022000024000709-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Modular SAT-based techniques for reasoning tasks in team semantics\",\"authors\":\"Arnaud Durand , Juha Kontinen , Jouko Väänänen\",\"doi\":\"10.1016/j.jcss.2024.103575\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.</p></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"146 \",\"pages\":\"Article 103575\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2024-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000709/pdfft?md5=257fe45a7b50d68c8b72d3df843b4963&pid=1-s2.0-S0022000024000709-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000024000709\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000024000709","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}

引用次数: 0

摘要

我们研究了团队语义逻辑推理任务的复杂性。我们的主要重点是模型检查的数据复杂性，但我们也得出了逻辑定义的计数和枚举问题的新结果。我们的方法基于将这些问题模块化还原为各类布尔公式的相应问题。我们通过几个新的可操作性/可实践性结果来说明我们的方法。

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

查看原文本刊更多论文

Modular SAT-based techniques for reasoning tasks in team semantics

We study the complexity of reasoning tasks for logics in team semantics. Our main focus is on the data complexity of model checking but we also derive new results for logically defined counting and enumeration problems. Our approach is based on modular reductions of these problems into the corresponding problems of various classes of Boolean formulas. We illustrate our approach via several new tractability/intractability results.

求助全文

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

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.