Topological investigations of the operators of the well-founded, and alternating fixed-point semantics of normal logic programs

Electronic Notes in Theoretical Computer Science

Volumn 74, Issue SUPPL., 2003, Pages 51-68

  Heinze, Roland ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY; TOPOLOGY;

DOMAIN THEORY; LOGIC PROGRAMMING SEMANTICS; QUERY TOPOLOGY; VIENNA DEVELOPMENT METHOD; ATOMIC TOPOLOGY; POSITIVE ATOMIC TOPOLOGY; SCOTT AND CANTOR TOPOLOGIES; VIENNA DEVELOPMENT METHODS;

LOGIC PROGRAMMING;

EID: 23844499230     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80765-5     Document Type: Conference Paper

References (16)

1. Batarekh A., Subrahmanian V.S. Topological model set deformations in logic programming. Fundamenta Informaticae. 12:1989;357-400
2. Fitting M. Kripke-Kleene-semantics for general logic programs. Journal of Logic Programming. 2:1985;295-312
3. Fitting M. Bilattices and the semantics of logic programming. Journal of Logic Programming. 11:1991;91-116
4. Fitting M., Well-founded semantics, generalized, in: Proceedings of the International Symposium on Logic Programming (1991), pp. 71-84.
5. Heinz R., "Topological and Generalized Metric Methods for Logic Programming Semantics," Dipomarbeit in Informatik, Universitát Bonn (2001).
6. Heinz R., P. Hitzler and A. K. Seda, Convergence classes and spaces of partial functions, in: Proceedings of the International Symposium on Domain Theory, Chengdu, China, 2001, Kluwer Academic Publishers, to appear.
7. Lloyd J.W. "Foundations of Logic Programming" second edition:1987;Springr Verlag, Berlin - Heidelberg - New York
8. Przymusinski T.C. The well-founded semantics coincides with the three-valued stable semantics. Special Edition of Fundamenta Informaticae on Non-Monotonic Reasoning. 13:1990;445-464
9. Rounds W.C., Zhang G.-Q. Clausal logic and logic programming in algebraic domains. Information and computation. 171:2001;183-200
10. Seda A.K. Topology and the semantics of logic programs. Fundamenta Informaticae. 24:1995;359-386
11. Seda A.K. Some convergence issues in theoretical computer science. Information. 5:2002;447-462
12. Seda, A. K. and P. Hitzler, Topology and iterates in computational logic, in: Proceedings of the 12th Summer Conference on Topology and its Applications: Special Session on Topology in computer Science, Ontario, 1997, Topology Proceedings 22:427-469, 1999.
13. Seda A.K., Hitzler P. Strictly level-decreasing logic programs. Butterfield A., Flynn S. 2nd Irish Workshop on Formaol Methods(IWFM-'98), Cork, 1998, EWIC. 1999;1-18 British Computer Society
14. van Gelder A. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences. 47:1993;185-221
15. van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. Journal of the ACM. 38:1991;620-650
16. Willard S. "General Topoloby" Series in Mathematics. 1970;Addison-Wesly Series in Mathematics, Massachusetts - California - London - Ontario