Complexity results for restricted credulous default reasoning

AI Communications

Volumn 13, Issue 4, 2000, Pages 249-257

  Zhao, Xishun ^a,c   Ding, Decheng ^b   Büning, Hans Kleine ^c  

^a HENAN NORMAL UNIVERSITY   (China)

^b NANJING UNIVERSITY   (China)

^c UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DECISION THEORY; MATHEMATICAL MODELS; POLYNOMIALS;

CREDULOUS REASONING; DEFAULT LOGIC; HORN DEFAULT;

LOGIC PROGRAMMING;

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

References (10)

1. R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980) 81-132.
2. 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.
3. R. Ben-Eliyahu and R. Dechter, Propositional semantics for default logic, Technical Report R-163, Cognitive Systems Laboratory, Computer Science Department, University of California at Los Angeles, July, 1992.
4. M. Cadoli and M. Schaerf, A survey of complexity results for mon-monotonic logics, J. Logic Programming 17 (1993) 127-160.
5. Y. Dimopoulos and V. Magirou, A graph theoretic approach to default logic, Inform. and Comput. 112 (1994) 239-256.
6. D.V. Etherington, Reasoning with Incomplete Information, Morgan Kaufman, Los Altos, CA, 1987.
7. H.A. Kautz and B. Selman, Hard problems for simple default logics, Artificial Intelligence 49 (1991) 243-279.
8. J. Stillman, It's not my default: The complexity of membership problems in restricted prepositional default logics, in: Proceedings of the Eighth National Conference on Artificial Intelligence (AAA-92), 1992, pp. 794-799.
9. H. Kleine Büning, Propositional Logic: Deduction and Algorithm, Cambridge University Press, 1999.
10. P. Besnard, An Introduction to Default Logic, Springer-Verlag, Berlin, 1989.