A tractable class of abduction problems

Authors:
Kave Eshghi
Affiliations:
Hewlett Packard Laboratories, Palo Alto, CA
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 4
Cited 4

An assumption-based TMS

Artificial Intelligence
A theory of diagnosis from first principles

Artificial Intelligence
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)

Automated Abduction

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
What makes propositional abduction tractable

Artificial Intelligence
Counting complexity of propositional abduction

Journal of Computer and System Sciences
Complexity issues related to propagation completeness

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding a set of assumptions which explain a given proposition is in general NP-hard, even when the background theory is an acyclic Horn theory. In this paper it is shown that when the background theory is acyclic Horn and its pseudo-completion is unit refutable, there is a polynomial time algorithm for finding minimal explanations. A test for unit-refutability of clausal theories is presented, based on the topology of the connection graph of the theory.