It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics

Proceedings of the 8th National Conference on Artificial Intelligence, AAAI 1990

Volumn , Issue , 1990, Pages 571-578

  Stillman, Jonathan ^a  

^a GE GLOBAL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEFAULT RULE; MEMBERSHIP PROBLEM; PROPOSITIONAL DEFAULT LOGIC; PROPOSITIONAL THEORIES; SIMPLIFYING ASSUMPTIONS;

EID: 0001419078     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Aspvall, V., Plass, M. F., and Tarjan, R. E. 1979. A lineartime algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (3).
2. Dowling, W. F., and Gallier, J. H. 1984. Linear time algorithms for testing the satisfiability of propositional horn formulas. Journal of Logic Programming, 3:267-284.
3. Etherington, D. W. 1987. Formalizing Non-Monotonic Reasoning Systems. Artificial Intelligence 31:41-85.
4. Etherington, D. W. 1988. Reasoning with Incomplete Information. Pitman, London.
5. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability. W. H. Freeman, New York.
6. Ginsberg, M. L., editor. 1987. Readings in Nonmonotonic Reasoning. Morgan Kaufman, Los Altos, CA, 1987.
7. Kautz, H. A., and Selman, B. 1989. Hard problems for simple default logics. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, 189-197, Toronto, Ontario, Canada.
8. McCarthy, J. 1977. Epistemological problems of artificial intelligence. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, 1038-1044. International Joint Conferences on Artificial Intelligence, Inc.
9. McCarthy, J. 1986. Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence, 28:89-166.
10. Minsky, M. 1975. A framework for representing knowledge. In Patrick Winston, editor, The Psychology of Computer Vision, pages 211-277. McGraw-Hill, New York.
11. Moore, R. C. 1983. Semantical considerations on nonmonotonic logic. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, 272-279, Karlsruhe, West Germany, International Joint Conferences on Artificial Intelligence, Inc.
12. Poole, D. L. 1986. Default reasoning and diagnosis as theory formation. Technical Report CS-86-08, Dept. of Computer Science, University of Waterloo.
13. Reiter, R. 1980. A logic for default reasoning. Artificial Intelligence, 13:81-132.
14. Shaefer, T. J. 1978. The Complexity of Satisfiability Problems. In Proceedings of the 10th Annual ACM Symp. on Theory of Computing, Association for Computing Machinery, New York.
15. Stillman, J. P. 1990a. The Complexity of Horn Theories with Normal Unary Defaults. In Proceedings of the 8th Canadian Artificial Intelligence Conference, (CSCSI/SCEIO-90), Ottawa, Canada.
16. Stillman, J. P. 1990b. The Complexity of Reasoning in Restricted Propositional Default Logics. In preparation.
17. Touretzky, D. S. 1986. The Mathematics of Inheritance Systems. Pitman, London.