Defeasible reasoning in Description Logics: an overview on DLN

P. Bonatti, I. Petrova, L. Sauro
{"title":"Defeasible reasoning in Description Logics: an overview on DLN","authors":"P. Bonatti, I. Petrova, L. Sauro","doi":"10.3233/ssw200043","DOIUrl":null,"url":null,"abstract":"DL^N is a recent approach that extends description logics with defeasible reasoning capabilities. In this paper we provide an overview on DL^N, illustrating the underlying knowledge engineering requirements as well as the characteristic features that preserve DL^N from some recurrent semantic and computational drawbacks. We also compare DL^N with some alternative nonmonotonic semantics, enlightening the relationships between the KLM postulates and DL^N.","PeriodicalId":102100,"journal":{"name":"Applications and Practices in Ontology Design, Extraction, and Reasoning","volume":"162 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applications and Practices in Ontology Design, Extraction, and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/ssw200043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

DL^N is a recent approach that extends description logics with defeasible reasoning capabilities. In this paper we provide an overview on DL^N, illustrating the underlying knowledge engineering requirements as well as the characteristic features that preserve DL^N from some recurrent semantic and computational drawbacks. We also compare DL^N with some alternative nonmonotonic semantics, enlightening the relationships between the KLM postulates and DL^N.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
描述逻辑中的可否定推理:DLN概述
DL^N是一种最新的方法,它扩展了描述逻辑与可撤销推理能力。在本文中,我们概述了DL^N,说明了潜在的知识工程需求以及使DL^N免受一些反复出现的语义和计算缺陷的特征特征。我们还比较了DL^N与一些可选的非单调语义,揭示了KLM公设与DL^N之间的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Modular Ontology Modeling: A Tutorial High-Quality Knowledge Graphs Generation: R2RML and RML Comparison, Rules Validation and Inconsistency Resolution Querying the Semantic Web via Rules CLARIAH: Enabling Interoperability Between Humanities Disciplines with Ontologies Representing Complex Knowledge for Exploration and Recommendation: The Case of Classical Music Information
×
引用
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