Herbrand性质，有限拟Herbrand模型，以及一个量化合取查询的Chandra-Merlin定理

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2017-06-20 DOI:10.1109/LICS.2017.8005073

S. Bova, F. Mogavero

{"title":"Herbrand性质，有限拟Herbrand模型，以及一个量化合取查询的Chandra-Merlin定理","authors":"S. Bova, F. Mogavero","doi":"10.1109/LICS.2017.8005073","DOIUrl":null,"url":null,"abstract":"A structure enjoys the Herbrand property if, whenever it satisfies an equality between some terms, these terms are unifiable. On such structures the expressive power of equalities becomes trivial, as their semantic satisfiability is reduced to a purely syntactic check.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries\",\"authors\":\"S. Bova, F. Mogavero\",\"doi\":\"10.1109/LICS.2017.8005073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A structure enjoys the Herbrand property if, whenever it satisfies an equality between some terms, these terms are unifiable. On such structures the expressive power of equalities becomes trivial, as their semantic satisfiability is reduced to a purely syntactic check.\",\"PeriodicalId\":313950,\"journal\":{\"name\":\"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2017.8005073\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2017.8005073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

如果一个结构在满足某些项之间的等式时，这些项是统一的，那么它就具有赫布兰性质。在这样的结构上，等式的表达能力变得微不足道，因为它们的语义可满足性被简化为纯粹的句法检查。

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

查看原文本刊更多论文

Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries

A structure enjoys the Herbrand property if, whenever it satisfies an equality between some terms, these terms are unifiable. On such structures the expressive power of equalities becomes trivial, as their semantic satisfiability is reduced to a purely syntactic check.

求助全文

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

来源期刊

2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

自引率

0.00%

发文量