An efficient first-order horn-clause abduction system based on the ATMS

Authors:
Hwee Tou Ng;Raymond J. Mooney
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Texas;Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Venue:
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Year:
1991

Citing 6
Cited 2

An assumption-based TMS

Artificial Intelligence
Problem solving with the ATMS

Artificial Intelligence
Diagnosing multiple faults

Artificial Intelligence
An Efficient First-Order Abduction System Based on the ATMS

An Efficient First-Order Abduction System Based on the ATMS
A knowledge-level account of abduction

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
On the mechanization of abductive logic

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

Abductive inference methods in problems of job planning in complex objects

Journal of Computer and Systems Sciences International
Abduction in work-planning problems in complex objects

Scientific and Technical Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for first-order Horn-clause abduction that uses an ATMS to avoid redundant computation. This algorithm is either more efficient or more general than any other previous abduction algorithm. Since computing all minimal abductive explanations is intractable, we also present a heuristic version of the algorithm that uses beam search to compute a subset of the simplest explanations. We present empirical results on a broad range of abduction problems from text understanding, plan recognition, and device diagnosis which demonstrate that our algorithm is at least an order of magnitude faster than an alternative abduction algorithm that does not use an ATMS.