用于自动推理的扩展三段论逻辑

Ersin Çine, Bora I. Kumova
{"title":"用于自动推理的扩展三段论逻辑","authors":"Ersin Çine, Bora I. Kumova","doi":"10.1109/UBMK.2017.8093522","DOIUrl":null,"url":null,"abstract":"In this work, we generalise the categorical syllogistic logic in several dimensions to a relatively expressive logic that is sufficiently powerful to encompass a wider range of linguistic semantics. The generalisation is necessary in order to eliminate the existential ambiguity of the quantifiers and to increase expressiveness, practicality, and adaptivity of the syllogisms. The extended semantics is expressed in an extended syntax such that an algorithmic solution of the extended syllogisms can be processed. Our algorithmic approach for deduction in this logic allows for automated reasoning directly with quantified propositions, without reduction of quantifiers.","PeriodicalId":201903,"journal":{"name":"2017 International Conference on Computer Science and Engineering (UBMK)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An extended syllogistic logic for automated reasoning\",\"authors\":\"Ersin Çine, Bora I. Kumova\",\"doi\":\"10.1109/UBMK.2017.8093522\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we generalise the categorical syllogistic logic in several dimensions to a relatively expressive logic that is sufficiently powerful to encompass a wider range of linguistic semantics. The generalisation is necessary in order to eliminate the existential ambiguity of the quantifiers and to increase expressiveness, practicality, and adaptivity of the syllogisms. The extended semantics is expressed in an extended syntax such that an algorithmic solution of the extended syllogisms can be processed. Our algorithmic approach for deduction in this logic allows for automated reasoning directly with quantified propositions, without reduction of quantifiers.\",\"PeriodicalId\":201903,\"journal\":{\"name\":\"2017 International Conference on Computer Science and Engineering (UBMK)\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computer Science and Engineering (UBMK)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/UBMK.2017.8093522\",\"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 International Conference on Computer Science and Engineering (UBMK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UBMK.2017.8093522","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在这项工作中,我们将直言三段论逻辑在几个维度上概括为一种相对富有表现力的逻辑,这种逻辑足够强大,可以涵盖更广泛的语言语义。为了消除量词的存在歧义,提高三段论的表现力、实用性和适应性,归纳是必要的。扩展语义用扩展语法表示,从而可以处理扩展三段论的算法解。在这个逻辑中,我们的演绎算法方法允许直接对量化命题进行自动推理,而不需要减少量词。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An extended syllogistic logic for automated reasoning
In this work, we generalise the categorical syllogistic logic in several dimensions to a relatively expressive logic that is sufficiently powerful to encompass a wider range of linguistic semantics. The generalisation is necessary in order to eliminate the existential ambiguity of the quantifiers and to increase expressiveness, practicality, and adaptivity of the syllogisms. The extended semantics is expressed in an extended syntax such that an algorithmic solution of the extended syllogisms can be processed. Our algorithmic approach for deduction in this logic allows for automated reasoning directly with quantified propositions, without reduction of quantifiers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信