MV Datalog+-:具有不确定观测的有效基于规则的推理

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Theory and Practice of Logic Programming Pub Date : 2022-02-03 DOI:10.1017/S1471068422000199
Matthias Lanzinger, Stefano Sferrazza, G. Gottlob
{"title":"MV Datalog+-:具有不确定观测的有效基于规则的推理","authors":"Matthias Lanzinger, Stefano Sferrazza, G. Gottlob","doi":"10.1017/S1471068422000199","DOIUrl":null,"url":null,"abstract":"Abstract Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like machine-learning systems, are not strictly binary but associated with some degree of (lack of) confidence in the observation. We propose MV-Datalog and \n$\\mathrm{MV-Datalog}^\\pm$\n as extensions of Datalog and \n$\\mathrm{Datalog}^\\pm$\n , respectively, to the fuzzy semantics of infinite-valued Łukasiewicz logic \n$\\mathbf{L}$\n as languages for effectively reasoning in scenarios where such uncertain observations occur. We show that the semantics of MV-Datalog exhibits similar model theoretic properties as Datalog. In particular, we show that (fuzzy) entailment can be decided via minimal fuzzy models. We show that when they exist, such minimal fuzzy models are unique and can be characterised in terms of a linear optimisation problem over the output of a fixed-point procedure. On the basis of this characterisation, we propose similar many-valued semantics for rules with existential quantification in the head, extending \n$\\mathrm{Datalog}^\\pm$\n .","PeriodicalId":49436,"journal":{"name":"Theory and Practice of Logic Programming","volume":"22 1","pages":"678 - 692"},"PeriodicalIF":1.4000,"publicationDate":"2022-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations\",\"authors\":\"Matthias Lanzinger, Stefano Sferrazza, G. Gottlob\",\"doi\":\"10.1017/S1471068422000199\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like machine-learning systems, are not strictly binary but associated with some degree of (lack of) confidence in the observation. We propose MV-Datalog and \\n$\\\\mathrm{MV-Datalog}^\\\\pm$\\n as extensions of Datalog and \\n$\\\\mathrm{Datalog}^\\\\pm$\\n , respectively, to the fuzzy semantics of infinite-valued Łukasiewicz logic \\n$\\\\mathbf{L}$\\n as languages for effectively reasoning in scenarios where such uncertain observations occur. We show that the semantics of MV-Datalog exhibits similar model theoretic properties as Datalog. In particular, we show that (fuzzy) entailment can be decided via minimal fuzzy models. We show that when they exist, such minimal fuzzy models are unique and can be characterised in terms of a linear optimisation problem over the output of a fixed-point procedure. On the basis of this characterisation, we propose similar many-valued semantics for rules with existential quantification in the head, extending \\n$\\\\mathrm{Datalog}^\\\\pm$\\n .\",\"PeriodicalId\":49436,\"journal\":{\"name\":\"Theory and Practice of Logic Programming\",\"volume\":\"22 1\",\"pages\":\"678 - 692\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2022-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theory and Practice of Logic Programming\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1017/S1471068422000199\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theory and Practice of Logic Programming","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/S1471068422000199","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 3

摘要

摘要现代应用程序结合了来自各种来源的信息。通常,其中一些来源,如机器学习系统,并不是严格的二进制,而是与观察中的某种程度的(缺乏)信心有关。我们提出MV-Datalog和$\mathrm{MV-Datalog}^\pm$分别作为Datalog和$\athrm{Datalog}^\pm$的扩展,以无限值ukasiewicz逻辑$\mathbf{L}$的模糊语义作为在发生这种不确定观测的场景中进行有效推理的语言。我们证明了MV数据日志的语义表现出与数据日志相似的模型理论性质。特别地,我们证明了(模糊)蕴涵可以通过最小模糊模型来确定。我们证明,当它们存在时,这种最小模糊模型是唯一的,并且可以用定点过程输出上的线性优化问题来表征。基于这一特征,我们为头部具有存在量化的规则提出了类似的多值语义,扩展了$\mathrm{Datalog}^\pm$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
Abstract Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like machine-learning systems, are not strictly binary but associated with some degree of (lack of) confidence in the observation. We propose MV-Datalog and $\mathrm{MV-Datalog}^\pm$ as extensions of Datalog and $\mathrm{Datalog}^\pm$ , respectively, to the fuzzy semantics of infinite-valued Łukasiewicz logic $\mathbf{L}$ as languages for effectively reasoning in scenarios where such uncertain observations occur. We show that the semantics of MV-Datalog exhibits similar model theoretic properties as Datalog. In particular, we show that (fuzzy) entailment can be decided via minimal fuzzy models. We show that when they exist, such minimal fuzzy models are unique and can be characterised in terms of a linear optimisation problem over the output of a fixed-point procedure. On the basis of this characterisation, we propose similar many-valued semantics for rules with existential quantification in the head, extending $\mathrm{Datalog}^\pm$ .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming 工程技术-计算机:理论方法
CiteScore
4.50
自引率
21.40%
发文量
40
审稿时长
>12 weeks
期刊介绍: Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, non-monotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.
期刊最新文献
Metric Temporal Equilibrium Logic over Timed Traces Multi-Shot Answer Set Programming for Flexible Payroll Management Unit Testing in ASP Revisited: Language and Test-Driven Development Environment Evaluating Datalog Tools for Meta-reasoning over OWL 2 QL Model Explanation via Support Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1