Complexity of argument-based default reasoning with specificity

AI Communications

Volumn 16, Issue 2, 2003, Pages 107-119

  Zhao, Xishun ^a  

^a SUN YAT SEN UNIVERSITY   (China)

Author keywords

Complexity; Default logic; Default reasoning with specificity

Indexed keywords

DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

DEFAULT REASONING;

FORMAL LOGIC;

EID: 0038679353     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. F. Baader and B. Hollunder, How to prefer more specific defaults in terminological default logic, in: Proc. IJCAI-93, Chambery, France, Morgan Kaufmann, San Mateo, CA, 1993, pp. 669-674.
2. F. Baader and B. Hollunder, Priorities on defaults with prerequisite and their application in treating specificity in terminological default logic, Journal of Automated Reasoning 15 (1995), 41-68.
3. R. Ben-Eliyahu and R. Dechter, Default logic, prepositional logic and constraints, in: Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), 1991.
4. R. Ben-Eliyahu and R. Dechter, Prepositional semantics for default logic, Technical Report R-163, Cognitive Systems Laboratory, Computer Science Department, University of California at Los Angeles, July, 1992.
5. O. Brewka, Adding priority and specificity to default logic, Lecture Notes in Artificial Intelligence, Vol. 838, Springer-Verlag, pp. 247-260.
6. G. Brewka, Reasoning about priorities in default logic, in: Proc. AAAI'94, 1994.
7. G. Brewka and T. Eiter, Prioritized default logic, in: Intellectics and Computational Logic, Applied Logic Series 19, Kluwer Academic Publishers, 2002, 27-45.
8. G. Brewka and T. Eiter, Preferred answer sets for extended logic programs, Artificial Intelligence 109 (1999), 297-356.
9. M. Cadoli, Tractable Reasoning in Artificial Intelligence, Springer, Berlin, 1994.
10. M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of non-monotonic reasoning a real drawback, Artificial Intelligence 88 (1996), 215-251.
11. M. Cadoli and M. Schaerf, A survey of complexity results for non-monotonic logics, J. Logic Programming 17 (1993), 127-160.
12. P. Cholewinski, W. Marek, A. Mikitiuk and M. Truszczyński, Computing with default logic, Artificial Intelligence 112 (1999), 105-146.
13. J.P. Delgrand and T.H. Schaub, A general approach to specificity in default reasoning, in: Proc. KR'94, 1994, pp. 47-158.
14. Y. Dimopoulos and V. Magirou, A graph theoretical approaches to default logic, Inform. and Comput. 112 (1994), 239-256.
15. P. M. Dung and T.C. Son, Default reasoning with specificity, Lecture Notes in Artificial Intelligence, Vol. 1861, Springer-Verlag, 2000.
16. P.M. Dung and T.C. Son, An argument-based approach to reasoning with specificity, Artificial Intelligence 133 (2001), 35-85.
17. T. Eiter and T. Lukasiewicz, Default reasoning from conditional knowledge bases: complexity and tractable cases, Artificial Intelligence 124 (2000), 169-241.
18. H. Geffner and J. Pearl, Conditional entailment: Bridging two approaches to default reasoning, Artificial Intelligence 53 (1992), 209-244.
19. M. Gelfond and T.C. Son, Prioritized default theory, Lecture Notes in Artificial Intelligence, Vol. 1471, Springer-Verlag, 1997.
20. G. Gottlob, Complexity results for non-monotonic logics, J. Logic and Comput. 2 (1992), 397-425.
21. G. Gottlob, The complexity of default reasoning under the stationary fixed point semantics, Information and Computation 121 (1995), 81-92.
22. D.S. Johnson, A catalog of complexity classes, Artificial Intelligence 63 (1993), 69-142.
23. H.A. Kautz and B. Selman, Hard problems for simple default logics, Artificial Intelligence 42 (1990), 311-348.
24. H. Kleine Büning and T. Lettmann, Prepositional Logic: Deduction and Algorithm, Cambridge University Press, 1999.
25. W. Marek and M. Truszczyński, Nonmonotonic Logic, Springer-Verlag, Berlin, 1993.
26. Y. Moinard, Preference by specificity in default logic, in: ESPRIT project DRUMS RP1 1st Workshop, Marseille, France, 1990.
27. J. Pearl, System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning, in: Proc. Third Conference on Theoretical Aspects of Reasoning about Knowledge, 1990.
28. J.L. Pollock, Defeasible reasoning, Cognitive Science 17 (1987), 481-518.
29. D. Poole, On the comparision of theories: preferring the most specific explanation, in: Proc. IJCAI-85, Los Angeles, 1985.
30. Przymusinka and T. Przymusinski, Stationary default extensions, Fundamenta Informaticae 21 (1994), 67-87.
31. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81-132.
32. R. Reiter and G. Criscuolo, On interacting defaults, in: Readings in Nonmonotonic Reasoning, M.L. Ginsberg, ed., Morgan Kaufmann Publisher, 1987.
33. J. Rintanen, On specificity in default logic, in: Proceedings IJCAI-95, 1474-1479.
34. J. Rintanen, Lexicographic priorities in default logic, Artificial Intelligence 106 (1998), 221-265.
35. J. Rintanen, Complexity of prioritized default logics, Journal of Artifical Intelligence Research 9 (1998), 423-461.
36. C. Sakama and K. Inoue, Prioritized logic programming and application to commonsense reasoning, Artificial Intelligence 123 (2000), 185-222.
37. G.R. Simari and R.P. Loui, A mathematical treatment of deafeasible reasoning and its implementation, Artificial Intelligence 52 (1992), 125-257.
38. J. Stillman, It's not my default: the complexity of membership problems in restricted propositional default logics, in: Proceedings of the Eighth National Conference on Artificial Intelligence (AAA-92), 1992, pp. 794-799.
39. L. Stockmeyer and A. Meyer, Word problem requiring exponential time, in: Proc. of the 5th ACM Symposium on the Theory of Computing, ACM, New York, 1973, pp. 1-9.
40. D.S. Touretzky, The Mathematics of Ingeritance Systems, Morgan Kaufmann, Los Altos, CA, 1986.
41. X. Zhao, D. Ding and H. Kleine Buening, Complexity results for restricted credulous reasoning, AI Communications 13 (2000), 249-257.
42. X. Zhao and D. Ding, Complexity results for 2CNF default theories, Fundamenta Informaticae 45 (2001), 393-404.
43. X. Zhao and D. Ding, Some algorithms for extension computation of nonmonotonic rule systems, Fundamenta Informaticae 48 (2001), 93-106.