守卫的口角:量化约束满足的可处理片段

2012 19th International Symposium on Temporal Representation and Reasoning Pub Date : 2012-09-12 DOI:10.1109/TIME.2012.19

Hubie Chen, Michal Wrona

{"title":"守卫的口角:量化约束满足的可处理片段","authors":"Hubie Chen, Michal Wrona","doi":"10.1109/TIME.2012.19","DOIUrl":null,"url":null,"abstract":"The first-order theory of dense linear orders without endpoints is well-known to be PSPACE-complete. We present polynomial-time tractability results for fragments of this theory which are defined by syntactic restriction, in particular, our fragments can be described using the framework of quantified constraint satisfaction over Ord-Horn clauses.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction\",\"authors\":\"Hubie Chen, Michal Wrona\",\"doi\":\"10.1109/TIME.2012.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The first-order theory of dense linear orders without endpoints is well-known to be PSPACE-complete. We present polynomial-time tractability results for fragments of this theory which are defined by syntactic restriction, in particular, our fragments can be described using the framework of quantified constraint satisfaction over Ord-Horn clauses.\",\"PeriodicalId\":137826,\"journal\":{\"name\":\"2012 19th International Symposium on Temporal Representation and Reasoning\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 19th International Symposium on Temporal Representation and Reasoning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.2012.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 19th International Symposium on Temporal Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2012.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

无端点的密集线性阶的一阶理论是pspace完备的。我们给出了由句法限制定义的该理论片段的多项式时间可追溯性结果，特别是我们的片段可以使用量化的Ord-Horn子句约束满足的框架来描述。

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

查看原文本刊更多论文

Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction

The first-order theory of dense linear orders without endpoints is well-known to be PSPACE-complete. We present polynomial-time tractability results for fragments of this theory which are defined by syntactic restriction, in particular, our fragments can be described using the framework of quantified constraint satisfaction over Ord-Horn clauses.

求助全文

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

来源期刊

2012 19th International Symposium on Temporal Representation and Reasoning

自引率

0.00%

发文量