广义 Sahlqvist 句法形状的多项式时间检查

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-09-18 DOI:10.1016/j.tcs.2024.114875

Krishna B. Manoorkar , Alessandra Palmigiano , Mattia Panettiere

{"title":"广义 Sahlqvist 句法形状的多项式时间检查","authors":"Krishna B. Manoorkar , Alessandra Palmigiano , Mattia Panettiere","doi":"10.1016/j.tcs.2024.114875","DOIUrl":null,"url":null,"abstract":"<div><p>The best known modal logics are axiomatized by Sahlqvist axioms, i.e., axioms of a syntactic shape which guarantees these formulas to have such excellent properties as canonicity and elementarity. Recently, the definition of Sahlqvist formulas has been generalized and extended from formulas in classical modal logic to inequalities (sequents) in a wide family of logics known as LE-logics. We introduce an algorithm which checks if a given inequality is generalized Sahlqvist in polynomial time.</p></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1021 ","pages":"Article 114875"},"PeriodicalIF":0.9000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0304397524004924/pdfft?md5=45608c7f83fcb56514df88d27c390c23&pid=1-s2.0-S0304397524004924-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Polynomial-time checking of generalized Sahlqvist syntactic shape\",\"authors\":\"Krishna B. Manoorkar , Alessandra Palmigiano , Mattia Panettiere\",\"doi\":\"10.1016/j.tcs.2024.114875\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The best known modal logics are axiomatized by Sahlqvist axioms, i.e., axioms of a syntactic shape which guarantees these formulas to have such excellent properties as canonicity and elementarity. Recently, the definition of Sahlqvist formulas has been generalized and extended from formulas in classical modal logic to inequalities (sequents) in a wide family of logics known as LE-logics. We introduce an algorithm which checks if a given inequality is generalized Sahlqvist in polynomial time.</p></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1021 \",\"pages\":\"Article 114875\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0304397524004924/pdfft?md5=45608c7f83fcb56514df88d27c390c23&pid=1-s2.0-S0304397524004924-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397524004924\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524004924","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

最著名的模态逻辑是由萨克维斯特公理（Sahlqvist axioms）公理化的，即一种语法形式的公理，这种公理保证了这些公式具有完备性和元素性等优良性质。最近，Sahlqvist 公式的定义得到了推广，从经典模态逻辑中的公式扩展到了被称为 LE 逻辑的一大系列逻辑中的不等式（序列）。我们引入了一种算法，可以在多项式时间内检查给定不等式是否为广义 Sahlqvist。

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

查看原文本刊更多论文

Polynomial-time checking of generalized Sahlqvist syntactic shape

The best known modal logics are axiomatized by Sahlqvist axioms, i.e., axioms of a syntactic shape which guarantees these formulas to have such excellent properties as canonicity and elementarity. Recently, the definition of Sahlqvist formulas has been generalized and extended from formulas in classical modal logic to inequalities (sequents) in a wide family of logics known as LE-logics. We introduce an algorithm which checks if a given inequality is generalized Sahlqvist in polynomial time.

求助全文

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

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.