Author:
CAROPRESE LUCIANO,TRUBITSYNA IRINA,Truszczyński Mirosław,Zumpano Ester
Abstract
AbstractWe study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of arbitrariness: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness — they are called constrained — being the preferred ones. In the paper, we study basic properties of constrained explanations. For the case when programs in abductive theories are stratified we establish results providing a detailed picture of the complexity of the problem to decide whether constrained explanations exist.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Assembling Fragments of Ancient Papyrus via Artificial Intelligence;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2023
2. Fake News Detection on COVID 19 tweets via Supervised Learning Approach;2022 IEEE International Conference on Bioinformatics and Biomedicine (BIBM);2022-12-06
3. Computing Abductive Explanations;IEEE Intelligent Systems;2022-11-01
4. Poster SIMPATICO 3D;2022 IEEE Symposium on Computers and Communications (ISCC);2022-06-30
5. Existential active integrity constraints;Expert Systems with Applications;2021-04