Clausal logic and logic programming in algebraic domains

Information and Computation

Volumn 171, Issue 2, 2001, Pages 183-200

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

^a UNIVERSITY OF MICHIGAN   (United States)

^b CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

Domain theory and applications; Logic programming; Logics in artificial intelligence

Indexed keywords

APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; INTERPOLATION; RECURSIVE FUNCTIONS; SEMANTICS; SET THEORY; SYNTACTICS;

CLAUSAL LOGIC;

LOGIC PROGRAMMING;

EID: 0035895134     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3073     Document Type: Article

References (23)

1. [Abr91] Abramsky, S. (1991), Domain theory in logical form, Ann. Pure Appl. Logic 51, 1-77.
2. [AJ94] Abramsky, S., and Jung, A. (1994), Domain theory, in "Handbook of Logic in Computer Science" (S. Abramsky. D. Gabbay, and T. S. E. Maibaum, Eds.), Vol. 3, Clarendon, Oxford.
3. [Apt90] Apt, K.R. (1990). Logic programming, in "Handbook of Theoretical Computer Science," Vol. B, pp. 495-571, MIT Press/Elsevier, Cambridge. MA.
4. [BG94] Baral, C., and Gelfond, M. (1994), Logic programming and knowledge representation. J. Logic Programming 19/20. 73-148.
5. [CZ00] Coquand, T., and Zhang, G. Q. (2000), Sequents, frames, and completeness, in "Computer Science Logic 2000" (P. Clote and H. Schwichtenberg. Eds.). Lecture Notes in Computer Science, Vol. 1862, pp. 277-291, Springer-Verlag, Berlin.
6. [HM81] Hofmann, K., and Mislove, M. W. (1981), "Local Compactness and Continuous Lattices," Lecture Notes in Mathematics, Vol. 871, pp, 209-240. Springer-Verlag, Berlin/New York.
7. [KP94] Keimel, K., and Paseka, J. (1994). A direct proof of the Hofmann-Mislove theorem, Proc. Amer. Math. Soc. 120, 301-303.
8. [KRZ98] Klavins, E., Rounds, W., and Zhang, G.-Q. (1998), Experimenting with power default reasoning, in "Proceedings of AAAI National Conference on Artificial Intelligence."
9. [LBAC96] Lascarides, A., Briscoe, E. J., Asher, N., and Copestake, A. (1996). Order independent persistent typed default unification. Linguistics and Philosophy 19, 1-89.
10. [LMR92] Lobo, J., Minker, J., and Rajasekar, A. (1992), "Foundations of Disjunctive Logic Programming," MIT Press Series in Logic Programming. MIT Press. Cambridge, MA.
11. [Mor98] Morgenstern, L. (1998), Inheritance comes of age: Applying nonmonotonic techniques to problems in industry. Artificial Intelligence 103, 237-271.
12. [NM98] Nadathur, G., and Miller, D. (1998). Higher-order logic programming, in "Handbook of Logic in Artificial Intelligence and Logic Programming," Vol. 5, pp. 499-590, Oxford Univ. Press, New York.
13. [Rei80] Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence 13, 81-132.
14. [RZ97] Rounds, W., and Zhang, G.-Q. (1997), Power defaults, in "Proceedings of 4th International Conference on Logic Programming and Non-monotonic Reasoning, July 1997," Lecture Notes in Artificial Intelligence, Vol. 1265, Springer-Verlag, Berlin/New York.
15. [Sco82] Scott, D. S. (1982), "Domains for Denotational Semantics," Lecture Notes in Computer Science, Vol. 140, Springer-Verlag, Berlin/New York.
16. [Smy78] Smyth, M. B. (1978). Powerdomains, J. Comput. System. Sci. 16, 23-36.
17. [Smy83] Smyth, M. B. (1983). "Powerdomains and Predicate Transformers: A Topological View," Lecture Notes in Computer Science, Vol. 298, pp. 236-253. Springer-Verlag, Berlin/New York.
18. [Vic89] Vickers, S. (1989). "Topology via Logic," Cambridge Univ. Press Cambridge, UK.
19. [Win83] Winskel, G. (1983). "A Note on Powerdomains and Modality," Lecture Notes in Computer Science, Vol. 158, Springer-Verlag, Berlin/New York.
20. [Zha91] Zhang, G.-Q. (1991). "Logic of Domains," Birkhauser, Boston.
21. [ZR97a] Zhang, G. Q., and Rounds, W. C. (1997). Complexity of power default reasoning, in "Proceedings of 113th IEEE Symposium on Logic in Computer Science," pp. 152-169.
22. [ZR97b] Zhang, G.-Q., and Rounds, W. (1997), Defaults in domain theory, Theoret. Comput. Sci. 177, 155-182.
23. [ZR99] Zhang, G. Q., and Rounds, W. C. (2001). Semantics of logic programs and representation of smyth powerdomain, in "Domains and Processes: Proceedings of the 1st International Symposium on Domain Theory" (K. Keimel et al., Eds.), pp. 151-181. Kluwer.