Abduction in logic programming: a new definition and an abductive procedure based on rewriting

Authors:
Fangzhen Lin;Jia-Huai You
Affiliations:
Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Computing Science, University of Alberta, Edmonton, AB, Canada
Venue:
Artificial Intelligence
Year:
2002

Citing 13
Cited 9

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

Foundations of logic programming; (2nd extended ed.)
Signed data dependencies in logic programs

Journal of Logic Programming
Completed logic programs and their consistency

Journal of Logic Programming
Extended stable semantics for normal and disjunctive programs

Logic programming
An analysis of loop checking mechanisms for logic programs

Theoretical Computer Science
Rewrite systems

Handbook of theoretical computer science (vol. B)
Abduction versus closure in causal theories

Artificial Intelligence
A three-valued semantics for deductive databases and logic programs

Journal of Computer and System Sciences
Stable models and non-determinism in logic programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Extending and implementing the stable model semantics

Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
From Causal Theories to Successor State Axioms and STRIPS-Like Systems

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence

Abductive logic programs with penalization: semantics, complexity and implementation

Theory and Practice of Logic Programming
Recycling computed answers in rewrite systems for abduction

ACM Transactions on Computational Logic (TOCL)
Outlier detection by logic programming

ACM Transactions on Computational Logic (TOCL)
What makes propositional abduction tractable

Artificial Intelligence
On odd and even cycles in normal logic programs

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Abductive logic programming by nonground rewrite systems

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The ciff proof procedure for abductive logic programming with constraints: Theory, implementation and experiments

Theory and Practice of Logic Programming
Detecting and repairing anomalous evolutions in noisy environments

Annals of Mathematics and Artificial Intelligence
A new framework for knowledge revision of abductive agents through their interaction

CLIMA IV'04 Proceedings of the 4th international conference on Computational Logic in Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A long outstanding problem for abduction in logic programming has been on how minimality might be defined. Without minimality, an abductive procedure is often required to generate exponentially many subsumed explanations for a given observation. In this paper, we propose a new definition of abduction in logic programming where the set of minimal explanations can be viewed as a succinct representation of the set of all explanations. We then propose an abductive procedure where the problem of generating explanations is formalized as rewriting with confluent and terminating rewrite systems. We show that these rewrite systems are sound and complete under the partial stable model semantics, and sound and complete under the answer set semantics when the underlying program is so-called odd-loop free. We discuss an application of abduction in logic programming to a problem in reasoning about actions and provide some experimental results.