量化等式约束

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007) Pub Date : 2007-07-10 DOI:10.1137/080725209

M. Bodirsky, Hubie Chen

{"title":"量化等式约束","authors":"M. Bodirsky, Hubie Chen","doi":"10.1137/080725209","DOIUrl":null,"url":null,"abstract":"An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.","PeriodicalId":137827,"journal":{"name":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Quantified Equality Constraints\",\"authors\":\"M. Bodirsky, Hubie Chen\",\"doi\":\"10.1137/080725209\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.\",\"PeriodicalId\":137827,\"journal\":{\"name\":\"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/080725209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/080725209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 33

摘要

等式模板(也称为等式约束语言)是一种具有无限域的关系结构，其关系可以通过等式的布尔组合来定义。我们证明了等式模板上量化约束满足问题(qcsp)的完全复杂性分类:这些问题是L(在对数空间中可决定的)、np -完全或pspace -完全的。为了建立我们的分类定理，我们将通用代数的方法与模型论的概念结合起来。

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

查看原文本刊更多论文

Quantified Equality Constraints

An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.

求助全文

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

来源期刊

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)

自引率

0.00%

发文量