Ordering default theories and nonmonotonic logic programs

Theoretical Computer Science

Volumn 338, Issue 1-3, 2005, Pages 127-152

  Sakama, Chiaki ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

Author keywords

Bilattice; Default logic; Logic programming; Multi valued logic

Indexed keywords

FAULT TREE ANALYSIS; KNOWLEDGE ACQUISITION; LOGIC PROGRAMMING; MATHEMATICAL PROGRAMMING; SEMANTICS; SET THEORY;

BILATTICE; DEFAULT LOGIC; MULTI-VALUED LOGIC; NONMONOTONIC LOGIC PROGRAMS;

FORMAL LOGIC;

EID: 18544373861     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.003     Document Type: Article

References (27)

1. C. Aravindan, and P.M. Dung On the correctness of unfold/fold transformation of normal and extended logic programs J. Logic Programming 22 1994 201 217
2. M. Bain, and S. Muggleton Non-monotonic learning S. Muggleton Inductive Logic Programming 1992 Academic Press New York 145 161
3. C. Baral, and M. Gelfond Logic programming and knowledge representation J. Logic Programming 19/20 1994 73 148
4. N.D. Belnap A useful four-valued logic J.M. Dunn G. Epstein Modern Uses of Multiple-Valued Logic 1975 Reidel Publishing Dordrecht 8 37
5. A. Bochman Biconsequence relations for nonmonotonic reasoning Proc. 5th Internat. Conf. on Principles of Knowledge Representation and Reasoning Morgan Kaufmann, Los Altos, CA 1996 482 492
6. S. Brass On the semantics of supernormal defaults Proc. 13th Internat. Joint Conf. Artificial Intelligence Morgan Kaufmann, Los Altos, CA 1993 578 583
7. G. Brewka, J. Dix, Knowledge representation with logic programs, in: Proc. 3rd Workshop on Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, Vol. 1471, Springer, Berlin, 1997, pp. 1-51.
8. C.V. Damásio, and L.M. Pereira A survey of paraconsistent semantics for logic programs D.M. Gabbay Ph. Smets Handbook of Defeasible Reasoning and Uncertainty Management Systems Vol. 2 1998 Kluwer Academic Dordrecht 241 320
9. F.M. Dionísio, S. Brass, M. Ryan, U. Lipeck, Hypothetical reasoning with defaults, in: Proc. Workshop on Computational Aspects of Nonmonotonic Reasoning, at the 7th Internat. Workshop on Nonmonotonic Reasoning, 1998.
10. J. Dix A framework for representing and characterizing semantics of logic programs Proc. 3rd Internat. Conf. on Knowledge Representation and Reasoning Morgan Kaufmann, Los Altos, CA 1992 591 602
11. M. Fitting Bilattices and the semantics of logic programming J. Logic Programming 11 1991 91 116
12. M. Gelfond, and V. Lifschitz Classical negation in logic programs and disjunctive databases New Generation Comput. 9 1991 365 385
13. M.L. Ginsberg Multi-valued logics a uniform approach to inference in artificial intelligence Comput. Intell. 4 1988 265 316
14. G. Gottlob Complexity results for nonmonotonic logics J. Logic Comput. 2 1992 397 425
15. K. Inoue, and Y. Kudoh Learning extended logic programs Proc. 15th Internat. Joint Conf. on Artificial Intelligence Morgan Kaufmann, Los Altos, CA 1997 176 181
16. V. Lifschitz, D. Pearce, and A. Valverde Strongly equivalent logic programs ACM Trans. Comput. Logic 2 2001 526 541
17. W. Marek, and M. Truszczynski Autoepistemic logic J. Assoc. Comput. Math. 38 3 1991 588 619
18. T. Niblett A study of generalization in logic programs Proc. 3rd European Working Sessions on Learning (EWSL-88) Pitman, London 1988 131 138
19. S.-H. Nienhuys-Cheng, R. de Wolf, Foundations of Inductive Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1228, Springer, Berlin, 1997.
20. R. Reiter A logic for default reasoning Artificial Intelligence 13 1980 81 132
21. S. Russell, and P. Norvig Artificial Intelligence A Modern Approach second ed. 1995 Prentice-Hall Englewood Cliffs, NJ
22. C. Sakama, Nonmonotonic inductive logic programming, in: Proc. 6th Internat. Conf. on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, Vol. 2173, Springer, Berlin, 2001, pp. 62-80.
23. C. Sakama Ordering default theories Proc. 18th Internat. Joint Conf. on Artificial Intelligence Morgan Kaufmann, Los Altos, CA 2003 839 844
24. C. Sakama, Induction from answer sets in nonmonotonic logic programs, ACM Trans. Comput. Logic, 6(2) (2005).
25. C. Sakama, and K. Inoue Paraconsistent stable semantics for extended disjunctive programs J. Automat. Reason. 13 1 1995 145 172
26. H. Tamaki, and T. Sato Unfold/fold transformation of logic programs Proc. 2nd Internat. Conf. on Logic Programming 1984 127 138
27. H. Turner, Strong equivalence for logic programs and default theories, (made easy), in: Proc. 6th Internat. Conf. on Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence, Vol. 2173, Springer, Berlin, 2001, pp. 81-92.