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

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 655-661

  Lin, Fangzhen ^a   You, Jia Huai ^b  

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

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET SEMANTICS; ANSWERING QUERIES; PARTIAL STABLE MODELS; REASONING ABOUT ACTIONS; REWRITING SYSTEMS; SOUND AND COMPLETE;

ARTIFICIAL INTELLIGENCE; SEMANTICS;

LOGIC PROGRAMMING;

EID: 84880886486     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. R. Bol, A. Krzysztof, and J. Klop. An analysis of loop checking mechanisms for logic programs. Theoretical Computer Science, 86(1):35-39, 1991.
2. L. Console, D. Theseider, and P. Porasso. On the relationship between abduction and deduction. J. Logic Programming, 2(5):661-690, 1991.
3. M. Denecker and D. De Schreye. Sldnfa: an abductive procedure for normal abductive programs. J. Logic Programming, 34(2):111-167, 1998.
4. N. Dershowitz and P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, Vol B: Formal Methods and Semantics, pages 243-320. North-Holland, 1990.
5. P.M. Dung. On the relation between stable and well-founded semantics of logic programs. Theoretical Computer Science, 105:7-25, 1992.
6. K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP, pages 234-254. MIT Press, 1989.
7. T. Fung and R. Kowalski. The iff proof procedure for abductive logic programming. J. Logic Programming, 33(2):151-164, 1997.
8. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th ICLP, pages 1070-1080. MIT Press, 1988.
9. L. Giordano, A. Martelli, and M. Sapino. Extending negation as failure by abduction: A three-valued stable model semantics. J. Logic Programming, 26(1), 1996.
10. A. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In Proc. 9th European Conf. for AI, 1990.
11. K. Konolige. Abduction versus closure in causal theories. Artificial Intelligence, 53:255-272, 1992.
12. K. Kunen. Signed data dependencies in logic programs. J. Logic Programming, 7(3):231-245, 1989. (Pubitemid 20633164)
13. F. Lin. From causal theories to successor state axioms: bridging the gap between nonmonotonic action theories and STRIPS-like formalisms. In Proc. AAAI '00, 2000.
14. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. and AI, 25(3-4):241-273, 1999.
15. D. Poole. Representing knowledge for logic-based diagnosis. In Proc. Fifth Generation Computer Systems Conference, pages 1282-1290, 1988.
16. T.C. Przymusinski. Extended stable semantics for normal and disjunctive logic programs. In Proc. 7th ICLP, pages 459-477. MIT Press, 1990.
17. R. Reiter and J. de Kleer. Foundations of ATMS. In Proc. AAAI87, 1987.
18. K. Satoh and N. Iwayama. Computing abduction using the tms. In Proc. the 8th International Conference on Logic Programming, 1991.
19. K. Satoh and R. Iwayama. A query evaluation method for abductive logic programming. In Proc. JICSLP'92, 1992.
20. J. You and L. Yuan. On the equivalence of semantics for normal logic programs. J. Logic Programming, 22:212-221, 1995.