Directly cautious theory of defeasible consequence for default logic via the notion of general extension

Artificial Intelligence

Volumn 109, Issue 1, 1999, Pages 71-109

  Antonelli, G Aldo ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL METHODS; FORMAL LOGIC; LOGIC PROGRAMMING;

CYCLIC NETWORKS; DEFAULT LOGIC; NONMONOTONIC INHERITANCE; TRUTH THEORY;

ARTIFICIAL INTELLIGENCE;

EID: 0033522697     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00014-4     Document Type: Article

References (32)

1. G.A. Antonelli, Defeasible inheritance on cyclic networks, Artificial Intelligence 92 (1997) 1-23.
2. G.A. Antonelli, Defeasible reasoning as a cognitive model, in: The Parikh Project. Seven Papers in Honour of Rohit, Uppsala Prints and Preprints in Philosophy, No. 18, Department of Philosophy, Uppsala University, 1996, pp. 1-13.
3. G.A. Antonelli, Virtuous circles, in: A. Gupta, A. Chapuis (Eds.), Special Issue of the Journal of the Indian Council of Philosophical Research on "Circularity, Definition, and Truth", to appear.
4. N.D. Belnap, A useful four-valued logic, in: J.M. Dunn, G. Epstein (Eds.), Modern Uses of Multiple-Valued Logic, Reidel, Dordrecht, 1977.
5. S. Brass, On the semantics of supernormal defaults, in: Proc. IJCAI-93, Chambery, France, 1993, Vol. I, Morgan Kaufmann, San Mateo, CA, 1993, pp. 578-583.
6. G. Brewka, Cumulative default logic: In defense of nonmonotonic inference rules, Artificial Intelligence 50 (1991) 183-205.
7. J.P. Delgrande, T. Schaub, W.K. Jackson, Alternative approaches to default logic, Artificial Intelligence 70 (1994) 167-237.
8. J. Dix, Default theories of poole-type and a method for constructing cumulative versions of default logic, in: B. Neumann (Ed.), Proc. 10th European Conference on Artificial Intelligence (ECAI-92), Wiley, New York, 1992, pp. 289-293.
9. D. Etherington, Formalizing nonmonotonic reasoning systems, Artificial Intelligence 31 (1987) 41-85.
10. Y. Dimopoulos, V Magirou, A graph theoretic approach to default logic, Inf. Comput., to appear.
11. M. Fitting, The family of stable models, J. Logic Programming 17 (1993) 197-225.
12. D.M. Gabbay, Theoretical foundations for nonmonotonic reasoning in expert systems, in: K. Apt (Ed.), Logics and Models of Concurrent Systems, Springer, Berlin, 1985, pp. 439-459.
13. A. van Gelder, K.A. Ross, J.S. Schlipf, The well-founded semantics for general logic programs, J. ACM (1990).
14. J.F. Horty, Some direct theories of nonmonotonic inheritance, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Nonmonotonic Reasoning and Uncertain Reasoning, Oxford Univ. Press, Oxford, 1994, pp. 111-187.
15. J.F. Horty, R.H. Thomason, D.S. Touretzky, A skeptical theory of inheritance in nonmonotonic semantic networks, Artificial Intelligence 42 (1990) 311-348.
16. H. Kautz, B. Selman, Hard problems for simple default logic, Artificial Intelligence 49 (1991) 243-279.
17. S. Kripke, Outline of a theory of truth, J. Philos. 72 (1975) 690-716.
18. W. Łukaszewicz, Considerations on default logic, in: Proc. Nonmonotonic Reasoning Workshop, New Paltz, NY, 1984, pp. 165-193.
19. W. Łukaszewicz, Considerations on default logic, Computational Intelligence 4 (1988) 1-16.
20. D. Makinson, General patterns in nonmonotonic reasoning, in: D.M. Gabbay, C.J. Hogger, J.A. Robinson (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3, Nonmonotonic Reasoning and Uncertain Reasoning, Oxford Univ. Press, Oxford, 1994.
21. D. Makinson, K. Schlechta, Floating conclusions and zombie paths: Two deep difficulties in the "directly skeptical" approach to defeasible inheritance nets, Artificial Intelligence 48 (1991) 199-209.
22. Z. Manna, A. Shamir, The theoretical aspects of the optimal fixedpoint, SIAM J. Comput. 5 (3) (1986) 414-426.
23. J. McCarthy, Epistemological problems of artificial intelligence, in: Proc. IJCAI-77, Cambridge, MA, MIT Press, 1977.
24. J. McCarthy, Circumscription - A form of nonmonotonic reasoning, Artificial Intelligence 13 (1980) 27-39, 171-172.
25. D. McDermott, J. Doyle, Nonmonotonic logic I, Artificial Intelligence 13 (1980) 41-72.
26. R.C. Moore, Semantical considerations on nonmonotonic logic, Artificial Intelligence 25 (1985) 75-94
27. . C.H. Papadimitriou, M. Sideri, Default theories that always have extensions, Artificial Intelligence 69 (1994) 347-357.
28. D.L. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988) 27-48.
29. T. Przymusiński, Three-valued nonmonotonic formalisms and semantics of logic programs, Artificial Intelligence 49 (1991) 309-343.
30. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81-132.
31. R. Reiter, G. Criscuolo, On interacting defaults, in: Proc. IJCAI-81, Vancouver, BC, 1981, pp. 270-276.
32. B. Selman, Tractable Default Reasoning, Ph.D. Thesis, University of Toronto, Toronto, Ont., 1990.