Horn公式等价问题的复杂性

Pub Date : 2022-04-29 DOI:10.1007/s10469-022-09665-z

N. T. Kogabaev

{"title":"Horn公式等价问题的复杂性","authors":"N. T. Kogabaev","doi":"10.1007/s10469-022-09665-z","DOIUrl":null,"url":null,"abstract":"<div><div><p>We look at the complexity of the existence problem for a Horn sentence (identity, quasi-identity, ∀-sentence, ∃-sentence) equivalent to a given one. It is proved that if the signature contains at least one symbol of arity k ≥ 2, then each of the problems mentioned is an m-complete <span>\\( {\\Sigma}_1^0 \\)</span> set.</p></div></div>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Complexity of the Problem of Being Equivalent to Horn Formulas\",\"authors\":\"N. T. Kogabaev\",\"doi\":\"10.1007/s10469-022-09665-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div><p>We look at the complexity of the existence problem for a Horn sentence (identity, quasi-identity, ∀-sentence, ∃-sentence) equivalent to a given one. It is proved that if the signature contains at least one symbol of arity k ≥ 2, then each of the problems mentioned is an m-complete <span>\\\\( {\\\\Sigma}_1^0 \\\\)</span> set.</p></div></div>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2022-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10469-022-09665-z\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10469-022-09665-z","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们研究了与给定句子等价的Horn句子（同一性、准同一性，∀-句子，∃-语句）存在性问题的复杂性。证明了如果签名包含至少一个arity k≥2的符号，则所提到的每个问题都是m-完全\（｛\ Sigma｝_1^0\）集。

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

查看原文

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

Complexity of the Problem of Being Equivalent to Horn Formulas

We look at the complexity of the existence problem for a Horn sentence (identity, quasi-identity, ∀-sentence, ∃-sentence) equivalent to a given one. It is proved that if the signature contains at least one symbol of arity k ≥ 2, then each of the problems mentioned is an m-complete \( {\Sigma}_1^0 \) set.

求助全文

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