谓词演算决策问题可解情形的复杂性

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI:10.1109/SFCS.1978.9

H. R. Lewis

{"title":"谓词演算决策问题可解情形的复杂性","authors":"H. R. Lewis","doi":"10.1109/SFCS.1978.9","DOIUrl":null,"url":null,"abstract":"We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus which obeys certain syntactic restrictions. For example, for the monadic predicate calculus and the Gödel or ∃ ... ∃∀∀∃ ... ∃ prefix class we obtain lower and upper nondeterministic time bounds of the form cn/log n. The main tool in in these proofs is a finite version of Wang's domino problem, about which we present an interesting open question.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"79","resultStr":"{\"title\":\"Complexity of solvable cases of the decision problem for the predicate calculus\",\"authors\":\"H. R. Lewis\",\"doi\":\"10.1109/SFCS.1978.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus which obeys certain syntactic restrictions. For example, for the monadic predicate calculus and the Gödel or ∃ ... ∃∀∀∃ ... ∃ prefix class we obtain lower and upper nondeterministic time bounds of the form cn/log n. The main tool in in these proofs is a finite version of Wang's domino problem, about which we present an interesting open question.\",\"PeriodicalId\":346837,\"journal\":{\"name\":\"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"79\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1978.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1978.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 79

摘要

我们分析了当F是经典谓词演算的一个公式，且有一定的句法限制时，判定F是否可满足的计算复杂度。例如，对于一元谓词演算和Gödel或∃…∃∀∀∃……∃前缀类我们得到了cn/log n形式的上下不确定性时间界限。这些证明中的主要工具是Wang的多米诺问题的有限版本，关于它我们提出了一个有趣的开放问题。

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

查看原文本刊更多论文

Complexity of solvable cases of the decision problem for the predicate calculus

We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus which obeys certain syntactic restrictions. For example, for the monadic predicate calculus and the Gödel or ∃ ... ∃∀∀∃ ... ∃ prefix class we obtain lower and upper nondeterministic time bounds of the form cn/log n. The main tool in in these proofs is a finite version of Wang's domino problem, about which we present an interesting open question.

求助全文

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

来源期刊

19th Annual Symposium on Foundations of Computer Science (sfcs 1978)

自引率

0.00%

发文量