Affiliation:
1. Technische Univ. Wien, Vienna, Austria
Abstract
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a logical theory, we speak about
logic-based abduction
. Candidates for abductive explanations are usually subjected to minimality criteria such as subset-minimality, minimal cardinality, minimal weight, or minimality under prioritization of individual hypotheses. This paper presents a comprehensive complexity analysis of relevant decision and search problems related to abduction on propositional theories. Our results indicate that abduction is harder than deduction. In particular, we show that with the most basic forms of abduction the relevant decision problems are complete for complexity classes at the second level of the polynomial hierarchy, while the use of prioritization raises the complexity to the third level in certain cases.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference73 articles.
1. Occam's Razor
2. ~BREWKA G. 1991. Nonrnonotonic Reasoning.' Logical Foundations of Cornrnonsense. Cambridge ~University Press Cambridge England. ~BREWKA G. 1991. Nonrnonotonic Reasoning.' Logical Foundations of Cornrnonsense. Cambridge ~University Press Cambridge England.
Cited by
245 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献