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

Artificial Intelligence

Volumn 140, Issue 1-2, 2002, Pages 175-205

  Lin, Fangzhen ^a   You, Jia Huai ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Abduction; Answer set programming; Rewrite systems

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; SEMANTICS;

ABDUCTION;

LOGIC PROGRAMMING;

EID: 0036724166     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00227-8     Document Type: Article

References (37)

1. An analysis of loop checking mechanisms for logic programs
2. Negation as failure
3. On the relationship between abduction and deduction
4. SLDNFA: An abductive procedure for normal abductive programs
5. Rewrite systems
6. An argumentation theoretic foundation for logic programming
7. Abduction compared with negation by failure
8. Consistency of Clark's completion and existence of stable models
9. The iff proof procedure for abductive logic programming
10. The stable model semantics for logic programming
11. Classic negation in logic programs and disjunctive database
12. Extending negation as failure by abduction: A three-valued stable model semantics
13. Confluent reductions: Abstract properties and applications to term rewriting systems
14. The role of abduction in logic programming
15. Generalized stable models: A semantics for abduction
16. ACLP: Abductive constraint logic programming
17. Abduction versus closure in causal theories
18. Signed data dependencies in logic programs
19. Answer set programming
20. Embracing causality in specifying the indirect effects of actions
21. From causal theories to successor state axioms: Bridging the gap between nonmonotonic action theories and STRIPS-like formalisms
22. From causal theories to logic programs (sometimes)
23. Stable models and an alternative logic programming paradigm
24. Logic programs with stable model semantics as a constraint programming paradigm
25. Representing knowledge for logic-based diagnosis
26. Extended stable semantics for normal and disjunctive logic programs
27. Foundations of assumption-based truth maintenance systems: Preliminary report
28. Stable models and non-determinism in logic programs with negation
29. Completed logic programs and their consistency
30. Computing abduction using the TMS
31. A query evaluation method for abductive logic programming
32. Extending and implementing the stable model semantics
33. A three-valued semantics for deductive databases and logic programs
34. On the equivalence of semantics for normal logic programs