带计数的一阶逻辑

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

D. Kuske, Nicole Schweikardt

{"title":"带计数的一阶逻辑","authors":"D. Kuske, Nicole Schweikardt","doi":"10.1109/LICS.2017.8005133","DOIUrl":null,"url":null,"abstract":"We introduce the logic FOCN(ℙ) which extends first-order logic by counting and by numerical predicates from a set ℙ, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature.","PeriodicalId":313950,"journal":{"name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"First-order logic with counting\",\"authors\":\"D. Kuske, Nicole Schweikardt\",\"doi\":\"10.1109/LICS.2017.8005133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce the logic FOCN(ℙ) which extends first-order logic by counting and by numerical predicates from a set ℙ, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature.\",\"PeriodicalId\":313950,\"journal\":{\"name\":\"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"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.8005133\",\"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.8005133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 24

摘要

我们引入了逻辑FOCN()，它通过计数和从一个集合的数值谓词扩展了一阶逻辑，并且可以看作是文献中研究过的各种计数逻辑的自然推广。

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

查看原文本刊更多论文

First-order logic with counting

We introduce the logic FOCN(ℙ) which extends first-order logic by counting and by numerical predicates from a set ℙ, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature.

求助全文

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

来源期刊

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

自引率

0.00%

发文量