Disjunctive explanations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2401 LNCS, Issue , 2002, Pages 317-332

  Inoue, Katsumi ^a   Sakama, Chiaki ^b  

^a KOBE UNIVERSITY   (Japan)

^b WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING; PROGRAM DIAGNOSTICS; RECONFIGURABLE HARDWARE;

ABDUCTIVE LOGIC PROGRAMMING; BELIEF REVISION; CAUSAL THEORY; DEFAULT REASONING; KNOWLEDGE BASE; KNOWLEDGE BASIS; MINIMAL ANSWERS; VIEW UPDATE;

COMPUTER CIRCUITS;

EID: 84888222419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45619-8_22     Document Type: Conference Paper

References (26)

1. S. Abiteboul. Updates, a new frontier. Proceedings of the 2nd International Conference on Database Theory, Lecture Notes in Computer Science, 326, Springer, pages 1-18, 1988.
2. F. Bry. Intensional updates: abduction via deduction. Proceedings of ICLP '90, pages 561-575, MIT Press, 1990.
3. L. Console, D.Theseider Dupre and P. Torasso. On the relationship between abduction and deduction. Journal of Logic and Computation, 1:661-690, 1991.
4. T. Eiter, G. Gottlob, and H.Mannila. Adding disjunction to Datalog. Proc. 13th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 267-278, 1994.
5. R. Fagin, J.D. Ullman, and M.Y. Vardi. On the semantics of updates in databases (preliminary report). Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 352-365, 1983.
6. R. Fagin, G. M. Kuper, J.D. Ullman, and M.Y. Vardi. Updating logical databases. Advances in Computing Research, Volume 3, pages 1-18, JAI Press, 1986.
7. J. Fernandez, J. Grant and J. Minker. Model theoretic approach to view updates in deductive databases. Journal of Automated Reasoning, 17:171-197, 1996.
8. T.H. Fung and R. Kowalski. The iff procedure for abductive logic programming. Journal of Logic Programming, 33:151-165, 1997.
9. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
10. J. Grant, J. Horty, J. Lobo and J. Minker. View updates in stratified disjunctive databases. Journal of Automated Reasoning, 11:249-267, 1993.
11. N. Helft, K. Inoue, and D. Poole. Query answering in circumscription. Proceedings of IJCAI-91, pages 426-431, Morgan Kaufmann, 1991.
12. K. Inoue. Hypothetical reasoning in logic programs. Journal of Logic Programming, 18(3):191-227, 1994.
13. K. Inoue. A simple characterization of extended abduction. In Proceedings of the 1st International Conference on Computational Logic, Lecture Notes in Artificial Intelligence, 1861, pages 718-732, Springer, 2000.
14. K. Inoue and C. Sakama. Abductive framework for nonmonotonic theory change. Proceedings of IJCAI-95, pages 204-210, Morgan Kaufmann, 1995.
15. K. Inoue and C. Sakama. A fixpoint characterization of abductive logic programs. Journal of Logic Programming, 27(2):107-136, 1996.
16. K. Inoue and C. Sakama. Computing extended abduction through transaction programs. Annals of Mathematics and Artificial Intelligence, 25(3, 4):339-367, 1999.
17. A. C. Kakas, R.A. Kowalski and F. Toni. The role of abduction in logic programming. D. M. Gabbay, C. J. Hogger and J.A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pages 235-324, Oxford University Press, 1998.
18. A. C. Kakas and P. Mancarella. Database updates through abduction. Proceedings of the 16th International Conference on Very Large Databases, pages 650-661, Morgan Kaufmann, 1990.
19. A. C. Kakas and P. Mancarella. Knowledge assimilation and abduction. In: J.P. Martins and M. Reinfrank (eds.), Truth Maintenance Systems, Lecture Notes in Artificial Intelligence, 515, 54-70, Springer, 1991.
20. K. Konolige. Abduction versus closure in causal theories. Artificial Intelligence, 53:255-272, 1992.
21. V. Lifschitz, L.R. Tang, and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999.
22. F. Lin. On strongest necessary and weakest sufficient conditions. Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning, pages 167-175, Morgan Kaufmann, 2000.
23. F. Lin and J.-H. You. Abductive logic programming: A new definition and an abductive procedure based on rewriting. Proceedings of IJCAI-01, pages 655- 661, Morgan Kaufmann, 2001.
24. V.W. Marek, and M. Truszczynski. Stable models and an alternative logic programming paradigm. K. R. Apt et al., editors, The Logic Programming Paradigm-A 25 Year Perspective, pages 375-398, Springer, 1999.
25. F. Rossi and S.A. Naqvi. Contributions to the view update problem. Proceedings of ICLP'89, pages 398-415, MIT Press, 1989.
26. C. Sakama and K. Inoue. Updating extended logic programs through abduction. Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, 1730, pages 147- 161, Springer, 1999.