Reasoning with power defaults

Theoretical Computer Science

Volumn 323, Issue 1-3, 2004, Pages 321-350

  Zhang, Guo Qiang ^a   Rounds, William C ^b  

^a Case Western Reserve University   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Complexity; Default logic; Domain theory; Nonmonotonic reasoning; Powerdomains

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FORMAL LOGIC; PROBLEM SOLVING; SEMANTICS; THEOREM PROVING;

COMPLEXITY; DEFAULT LOGIC; DOMAIN THEORY; NONMONOTONIC REASONING; POWER DEFAULT REASONING (PDR); POWERDOMAINS;

ARTIFICIAL INTELLIGENCE;

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

References (27)

1. S. Abramsky, Domain theory in logical form, Ann. Pure Appl. Logic 51 (1991).
2. H. Aït-Kaci, A lattice-theoretic approach to computation based on a calculus of partially ordered type structures, Ph.D. Thesis, University of Pennsylvania, 1984.
3. Amadio R., Curien P.-L. Domains and Lambda-Calculi. 1998;Cambridge University Press, Cambridge.
4. J. Barwise, J. Seligman, Information Flow: the Logic of Distributed Systems, Cambridge Tracts in TCS, Vol. 44, Cambridge Univ. Press, Cambridge, 1997.
5. P. Buneman, Functional programming and databases, in: D. Turner (Ed.), Research Topics in Functional Programming, Addison-Wesley, Reading, MA, 1990, pp. 155-169.
6. Cai J.Y., Gundermann T., Hartmanis J., Hemachandra L., Sewelson V., Wagner K., Wechsung K. The Boolean hierarchy. I. structural properties SIAM J. Comput. 17:1988;1232-1252.
7. Cai J.Y., Gundermann T., Hartmanis J., Hemachandra L., Sewelson V., Wagner K., Wechsung K. The Boolean hierarchy. II. applications SIAM J. Comput. 17:1988;1232-1252.
8. M. Gelfond, V. Lifschitz, H. Przymuzińska, M. Truszczyński, Disjunctive defaults, in: J. Allen, R. Fikes, E. Sandewall (Eds.), Proc. Second Annual Conf. on Knowledge Representation, Morgan Kaufmann, Los Altos, CA, 1991, pp. 230-237.
9. Gottlob G. Complexity results for non-monotonic logics. J. Logic Comput. 2(3):1992;397-425.
10. Gottlob G. The complexity of reasoning under the stationary fixed point semantics. Inform. and Comput. 121(1):1995;81-92.
11. C.A. Gunter, D.S. Scott, Semantic domains, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 633-674 (Chapter 12).
12. H. Kautz, B. Selman, Hard problems for simple default logics, in: Proc. of KR 89, Morgan Kaufmann, Los Altos, CA, 1989, pp. 189-197.
13. E. Klavins, W. Rounds, G.-Q. Zhang, Experimenting with power default reasoning, in: J. Mostow, C. Rich (Eds.), Proc. of AAAI National Conf. on Artificial Intelligence, The MIT Press, Cambridge, MA, 1998, pp. 846-852.
14. Kraus S., Lehmann D., Magidor M. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence. 44:1990;167-207.
15. L. Libkin, Aspects of partial information in databases, Ph.D. Thesis, University of Pennsylvania, 1994.
16. W. Marek, A. Nerode, J. Remmel, A theory of nonmonotonic rule systems, in: Proc. Fifth IEEE Symp. on Logic in Computer Science, 1990, pp. 79-94.
17. Papadimitriou C.H. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
18. F. Pereira, S. Shieber, The semantics of grammar formalisms seen as computer languages, in: Proc. 10th Internat. Conf. on Computational Linguistics: COLING 84, 1984.
19. G. Plotkin. Notes on Domains (Pisa notes), University of Edinburgh, 1983. Available at: http://www.dcs.ed.ac.uk/home/gdp/publications/.
20. C. Pollard, M.A. Moshier, Unifying partial descriptions of sets, in: P. Hansen (Ed.), Vancouver Studies in Cognitive Science, Vol. 1, University of British Columbia Press, Vancouver, Canada, 1990.
21. Przymusińska H., Przymusiński T. Stationary default extensions. Fund. Inform. 21:1994;67-87.
22. Reiter R. A logic for default reasoning. Artificial Intelligence. 13:1980;81-132.
23. Rounds W., Zhang G.-Q. Clausal logic and logic programming in algebraic domains. Inform. and Comput. 171:2001;183-200.
24. Winskel G. The Formal Semantics of Programming Languages. 1993;MIT Press, Cambridge, MA.
25. Zhang G.-Q. Logic of Domains. 1991;Birkhauser, Boston.
26. G.-Q. Zhang, W. Rounds, Complexity of power default reasoning, in: Proc. 12th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1997, pp. 328-339.
27. G.-Q. Zhang, W. Rounds, Reasoning with power defaults (preliminary report), in: Proc. Fourth Internat. Conf. on Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Computer Science, Springer, New York, 1997, pp. 152-169.