当前位置: X-MOL 学术Ann. Math. Artif. Intel. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations
Annals of Mathematics and Artificial Intelligence ( IF 1.2 ) Pub Date : 2019-08-30 , DOI: 10.1007/s10472-019-09653-7
Christoph Beierle , Steven Kutsch , Kai Sauerwald

Several different semantics have been proposed for conditional knowledge bases R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document} containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document}. For the notion of c-representations which are a subclass of all ranking functions accepting R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document}, a skeptical inference relation, called c-inference and taking all c-representations of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document} into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document} is reused for incrementally compiling extensions, contractions, and updates of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document}. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document}. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme.

中文翻译:

用于计算诱导非单调推理关系的静态和演化条件知识库的编译

对于 c 表示的概念,它是接受 R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} 的所有排名函数的子类\usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document},一种怀疑推理关系,称为c-inference,取所有R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength {\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document} 已被建议。在本文中,我们为知识库和对约束满足问题的怀疑查询开发了一个三阶段编译方案。除了怀疑 c 推理之外,我们还展示了如何将轻信和弱怀疑 c 推理建模为约束满足问题,并且编译方案可以扩展到此类查询。我们进一步将编译方法扩展到随时间演变的知识库。R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength 的编译形式{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document} 用于增量编译扩展、收缩、和 R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{ 的更新\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document}。对于每个编译步骤,我们证明了它的健全性和完整性,并在查询 R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{ 的编译版本时证明了显着的效率优势amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {R}$\end{document}。这些发现也得到了软件系统 InfoOCF 实验的支持,该系统采用了建议的编译方案。
更新日期:2019-08-30
down
wechat
bug