Computing abduction by using TMS with top-down expectation

Journal of Logic Programming

Volumn 44, Issue 1-3, 2000, Pages 179-206

  Iwayama, Noboru ^a   Satoh, Ken ^b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COMPUTER PROGRAM LISTINGS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; PROGRAM DIAGNOSTICS;

ABDUCTIVE LOGIC PROGRAMMING; GENERALIZED STABLE MODELS; INTEGRITY CONSTRAINT; TRUTH MAINTENANCE SYSTEM;

LOGIC PROGRAMMING;

EID: 0034230834     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00076-X     Document Type: Article

References (35)

1. A. Bondarenko, F. Toni, R.A. Kowalski, An assumption-based framework for non-monotonie reasoning, LPNMR'93 (1993) 171-189.
2. A. Bondarenko, P.M. Dung, R.A. Kowalski, F. Toni, An abstract, argumentation-theoretic approach to default reasoning, Artificial Intelligence 93 (1-2) (1997) 63-101.
3. W. Chen, D.S. Warren, Tabled evaluation with delaying for general logic programs, Journal of the ACM 43 (1) (1996) 20-74.
4. P. Cholewiński, V.W. Marek, M. Truszczyński, Default reasoning system DeReS, in: Proceedings of KR'96, 1996, pp. 518-528.
5. P. Cholewiński, Reasoning with stratified default theories, LPNMR'95 (1995) 273-286.
6. M. Denecker, D. De Schreye, SLDNFA: an abductive procedure for normal abductive programs, in: Proceedings of JICSLP'92, 1992, pp. 686-700.
7. M. Denecker, D. De Schreye, SLDNFA: an abductive procedure for abductive logic programs, Journal of Logic Programming 32 (2) (1998) 111-167.
8. J. Doyle, A truth maintenance system, Artificial Intelligence 12 (1979) 231-272.
9. P.M. Dung, Negations as hypotheses: an abductive foundation for logic programming, in: Proceedings of ICLP'91, 1991, pp. 3-17.
10. C. Elkan, A rational reconstruction of nonmonotonic truth maintenance systems, Artificial Intelligence 43 (1990) 219-234.
11. K. Eshghi, R.A. Kowalski, Abduction compared with negation by failure, in: Proceedings of ICLP'89, 1989, pp. 234-254.
12. K. Eshghi, Computing stable models by using the ATMS, in: Proceedings of AAAI'90, 1990, pp. 272-277.
13. F. Fages, A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics, in: Proceedings of ICLP'90, 1990, pp. 442-458.
14. Y. Fujiwara, S. Honiden, Relating the TMS to autoepistemic logic, in: Proceedings of IJCAI'89, 1989, pp. 1199-1205.
15. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proceedings of LP'88, 1988, pp. 1070-1080.
16. L. Giordano, A. Martelli, Generalized stable models truth maintenance and conflict resolution, in: Proceedings of ICLP'90, 1990, pp. 427-441.
17. K. Inoue, M. Koshimura, R. Hasegawa, Embedding negation as failure into a model generation theorem prover, in: Proceedings of the 11th International Conference Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 697, 1992, pp. 400-415.
18. K. Inoue, C. Sakama, Transforming abductive logic programs to disjunctive programs, in: Proceedings of ICLP'93, 1993.
19. U. Junker, K. Konolige, Computing the extensions of autoepistemic and default logics with a truth maintenance system, in: Proceedings of AAAI'90, 1990, pp. 278-223.
20. A.C. Kakas, P. Mancarella, On the relation between truth maintenance and abduction, in: Proceedings of PRICAI'90, 1990, pp. 438-443.
21. A.C. Kakas, P. Mancarella, Generalized stable models: a semantics for abduction, in: Proceedings of ECAI'90, 1990, pp. 385-391.
22. A.C. Kakas, R.A. Kowalski, R. Toni, Abductive logic programming, Journal of Logic and Computation 2 (6) (1992) 719-770.
23. R. Manthey, F. Bry, SATCHMO: a theorem prover in PROLOG, CADE-88, 1988.
24. I. Niemelä, P. Simons, Efficient implementation of the well-founded and stable model semantics, in: Proceedings of JICSLP'96, 1992, pp. 671-685.
25. I. Niemelä, P. Simons, Smodels - an implementation of the stable model and well-founded semantics for normal logic programs, in: Proceedings of LPNMR'97, 1997.
26. S.G. Pimentel, J.L. Cuadrado, A truth maintenance system based on stable models, in: Proceedings of NACLP'89, 1989, pp. 274-290.
27. R. Ramakrishnan, Magic templates: a spellbinding approach to logic programming, in: Proceedings of ICLP'88, 1988.
28. A. Ramsay, Generating relevant models, Journal of Automated Reasoning 7 (1991) 359-368.
29. P. Rao, K. Sagonoas, T. Swift, D. Warren, J.S. Freire, XSB: a system for efficiently computing well-founded semantics, LPNMR'97, 1997.
30. M. Reinfrank, O. Dressler, G. Brewka, On the relation between truth maintenance and autoepistemic logic, in: Proceedings of IJCAI'89, 1989, pp. 1206-1212.
31. D. Saccà, C. Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proceedings of PODS'90, 1990, pp. 205-217.
32. K. Satoh, N. Iwayama, E. Sugino, K. Konolige, An implementation of TMS in concurrent logic programming language, Preliminary Report, ICOT-TR-568, ICOT 1990.
33. K. Satoh, N. Iwayama, Computing abduction by using TMS, in: Proceedings of ICLP'91, 1991, pp. 505-518.
34. K. Satoh, N. Iwayama, A query evaluation method for abductive logic programming, in: Proceedings of JICSLP'92, 1992, pp. 671-685.
35. F. Toni, R.A. Kowalski, Reduction of abductive logic programs to normal logic programs, in: Proceedings of ICLP'95, 1995, pp. 367-381.