Mathematical aspects of logic programming semantics

Mathematical Aspects of Logic Programming Semantics

Volumn , Issue , 2016, Pages 1-264

  Hitzler, Pascal ^a   Seda, Anthony ^b  

^a WRIGHT STATE UNIVERSITY   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

BIFURCATION (MATHEMATICS); COMPUTATION THEORY; COMPUTER CIRCUITS; FIXED POINT ARITHMETIC; FUNCTIONS; INTEGRATION; KNOWLEDGE REPRESENTATION; SEMANTICS;

CONNECTIONIST SYSTEMS; GENERALIZED DISTANCES; KNOWLEDGE REPRESENTATION AND REASONING; LOGIC PROGRAMMING SEMANTICS; MATHEMATICAL ANALYSIS; MODELS OF COMPUTATION; NEURAL-SYMBOLIC INTEGRATION; NON-CONVENTIONAL METHODS;

LOGIC PROGRAMMING;

EID: 85052319847     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (231)

1. Abramsky, S. and Jung, A. (1994). Domain theory. In Abramsky, S., Gabbay, D. M., and Maibaum, T. S., editors, Handbook of Logic in Computer Science, Volume 3, pages 1-168. Oxford University Press, Oxford, UK. An expanded and corrected version is available at http://www.cs.bham.ac.uk/~axj/papers.html.
2. Albeverio, S., Khrennikov, A. Y., and Kloeden, P. (1999). Memory retrieval as a p-adic dynamical system. Biosystems, 49:105-115.
3. Antoniou, G. (1996). Non-Monotonic Reasoning. MIT Press, Cambridge, MA.
4. Apt, K. R. (1997). From Logic Programming to Prolog. International Series in Computer Science. Prentice Hall, Upper Saddle River, NJ.
5. Apt, K. R. and Bezem, M. (1990). Acyclic programs. In Warren, D. H. and Szeredi, P., editors, Proceedings of the Seventh International Conference on Logic Programming, pages 617-633. MIT Press, Cambridge, MA.
6. Apt, K. R. and Pedreschi, D. (1994). Modular termination proofs for logic and pure Prolog programs. In Levi, G., editor, Advances in Logic Programming Theory, pages 183-229. Oxford University Press, Oxford, UK.
7. Apt, K. R. and Wallace, M. (2007). Constraint Logic Programming Using Eclipse. Cambridge University Press, London; New York.
8. Apt, K. R., Blair, H. A., and Walker, A. (1988). Towards a theory of declarative knowledge. In Minker, J., editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann Publishers, Los Altos, CA.
9. Arnold, A. and Nivat, M. (1980a). Metric interpretations of infinite trees and semantics of non-deterministic recursive programs. Theoretical Computer Science, 11:181-205.
10. Arnold, A. and Nivat, M. (1980b). The metric space of infinite trees: Algebraic and topological properties. Fundamenta Informaticae, 3(4):445-476.
11. Bader, S. (2009). Neural-Symbolic Integration. PhD thesis, Department of Computer Science, TU Dresden, Dresden, Germany.
12. Bader, S. and Hitzler, P. (2004). Logic programs, iterated function systems, and recurrent radial basis function networks. Journal of Applied Logic, 2(3):273-300.
13. Bader, S. and Hitzler, P. (2005). Dimensions of neural-symbolic integration - A structured survey. In Artemov, S. N., Barringer, H., d'Avila Garcez, A. S., Lamb, L. C., and Woods, J., editors, We Will Show Them! Essays in Honour of Dov Gabbay, Volume One, pages 167-194. College Publications, London, UK.
14. Bader, S., Hitzler, P., and d'Avila Garcez, A. S. (2005a). Computing first-order logic programs by fibring artificial neural networks. In Russell, I. and Markov, Z., editors, Proceedings of the 18th International Florida Artificial Intelligence Research Society Conference, FLAIRS05, Clearwater Beach, Florida, May 2005, pages 314-319. AAAI Press, Menlo Park, CA.
15. Bader, S., Hitzler, P., and Witzel, A. (2005b). Integrating first-order logic programs and connectionist systems - A constructive approach. In d'Avila Garcez, A., Elman, J., and Hitzler, P., editors, Proceedings of the IJCAI-05 Workshop on Neural-Symbolic Learning and Reasoning, NeSy'05, Edinburgh. AAAI Press, Menlo Park, CA.
16. Bader, S., Hitzler, P., and Holldobler, S. (2006). The integration of connectionism and first-order knowledge representation and reasoning as a challenge for artificial intelligence. Information, 9(1):7-20.
17. Bader, S., Hitzler, P., Holldobler, S., and Witzel, A. (2007). A fully connectionist model generator for covered first-order logic programs. In Veloso, M., editor, Proceedings of the International Joint Conference on Artificial Intelligence IJCAI07, pages 666-671, Hyderabad, India. AAAI Press, Menlo Park, CA.
18. Bader, S., Hitzler, P., and Holldobler, S. (2008). Connectionist model generation: A first-order approach. Neurocomputing, 71(13-15):2420-2432.
19. Baral, C. (2003). Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, London; New York.
20. Bartle, R. G. (1966). The Elements of Integration. John Wiley & Sons, New York.
21. Batarekh, A. (1989). Topological Aspects of Logic Programming. PhD thesis, Syracuse University, Syracuse, New York.
22. Batarekh, A. and Subrahmanian, V. S. (1989a). The query topology in logic programming. In Monien, B. and Cori, R., editors, Proceedings of the 1989 Symposium on Theoretical Aspects of Computer Science, STACS 89, Paderborn, Germany, February, 1989, Lecture Notes in Computer Science, Volume 349, pages 375-387. Springer, Berlin.
23. Batarekh, A. and Subrahmanian, V. S. (1989b). Topological model set deformations in logic programming. Fun- damenta Informaticae, 12(3):357-400.
24. Belnap, N. D. (1977). A useful four-valued logic. In Dunn, J. M. and Epstein, G., editors, Modern Uses of Multiple-Valued Logic, pages 5-37. Reidel, Dordrecht, The Netherlands.
25. Berzati, D. (2007). Non-Monotonic Reasoning: A Unified Framework. Nova Science Publishers, New York.
26. Bessaga, C. (1959). On the converse of the Banach fixed-point principle. Colloquium Mathematicum, 7:41-43.
27. Bezem, M. (1989). Characterizing termination of logic programs with level mappings. In Lusk, E. L. and Overbeek, R. A., editors, Proceedings of the North American Conference on Logic Programming, pages 69-80. MIT Press, Cambridge, MA.
28. Bidoit, N. and Froideveaux, C. (1991). Negation by default and unstratifiable logic programs. Theoretical Computer Science, 78:85-112.
29. Bishop, C. M. (1995). Neural Networks for Pattern Recognition. Oxford University Press, Oxford.
30. Blair, H. A. (2007). Elementary differential calculus on discrete, continuous and hybrid spaces. In Kopperman, R., Panan- gaden, P., Smyth, M. B., and Spreen, D., editors, Computational Structures for Modelling Space, Time and Causality, August, 2006, Volume 6341 of Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany.
31. Blair, H. A. and Remmel, J. (2001). Hybrid automata: Convergence spaces and continuity. In Proceedings of the Joint IIIS & IEEE Meeting of the 5th World Multiconference on Systemics, Cybernetics and Informatics, SCI2001, and the 7th International Conference on Information Systems Analysis and Synthesis, ISAS2001, Volume XVII, Orlando, Florida, USA, pages 218-222. International Institute of Informatics and Systemics: IIIS, Winter Garden, FL.
32. Blair, H. A., Chidella, J., Dushin, F., Ferry, A., and Hu-Menn, P. (1997a). A continuum of discrete systems. Annals of Mathematics and Artificial Intelligence, 21(2-4):155-185.
33. Blair, H. A., Dushin, F., and Humenn, P. (1997b). Simulations between programs as cellular automata. In Dix, J., Furbach, U., and Nerode, A., editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the fith International Conference LPNMR97, Dagstuhl, Lecture Notes in Artificial Intelligence, Volume 1265, pages 115-131. Springer, Berlin.
34. Blair, H. A., Dushin, F., Jakel, D. W., Rivera, A. J., and Sezgin, M. (1999). Continuous models of computation for logic programs. In Apt, K. R., Marek, V. W., Truszczynski, M., and Warren, D. S., editors, The Logic Programming Paradigm: A 25-Year Persepective, pages 231-255. Springer, Berlin.
35. Blair, H. A., Jakel, D. W., Irwin, R. J., and Rivera, A. (2007). Elementary differential calculus on discrete and hybrid structures. In Artemov, S. N. and Nerode, A., editors, Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June f-7, 2007, Proceedings, Lecture Notes in Computer Science, Volume 4514, pages 41-53. Springer, Berlin.
36. Bochman, A. (1995). Default consequence relations as a logical framework for logic programs. In Marek, V. W. and Nerode, A., editors, Proceedings of the Third International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'95), Lexington, KY, USA, June 26-28, 1995, Lecture Notes in Computer Science, Volume 928, pages 245-258. Springer-Verlag, Berlin.
37. Boley, H. and Kifer, M., editors (22 June, 2010). RIF Basic Logic Dialect. W3C Recommendation. Available from the website http://www.w3.org/TR/rif-bld/.
38. Bonnier, S., Nilsson, U., and Näslund, T. (1991). A simple fixed-point characterization of the three-valued stable model semantics. Information Processing Letters, 40(2):73-78.
39. Bonsangue, M. M., van Breugel, F., and Rutten, J. J. (1996). Alexandroff and Scott topologies for generalized metric spaces. In Andima, S., Flagg, R., Itzkowitz, G., et al., editors, Papers on General Topology and Applications: Eleventh Summer Conference on General Topology and Applications, University of Southern Maine, Maine, USA, August, 1996, Annals of the New York Academy of Sciences, pages 49-68. New York Academy of Sciences, New York.
40. Bornscheuer, S.-E. (1996). Rational models of normal logic programs. In KI-96: Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence, Volume 1137, pages 1-4. Springer, Berlin.
41. Bouamama, S., Misane, D., and Priess-Crampe, S. (2000). An application of ultrametric spaces in logic programming. In Proceedings of the Sixth Maghrebian Conference on Computer Sciences. Maghrebian Information Processing Society, Fes, Moroco.
42. Bramer, M. (2010). Logic Programming with Prolog. Springer, Berlin.
43. Buillame-Bert, M., Broda, K., and d'Avila Garcez, A. (2010). First-order logic learning in artificial neural networks. In Proceedings IJCNN 2010. IEEE. In press.
44. Bukatin, M. A. (2002). Mathematics of Domains. PhD thesis, Brandeis University, Waltham, MA.
45. Bukatin, M. A. and Scott, J. S. (1997). Towards computing distances between programs via Scott domains. In Adian, S. and Nerode, A., editors, Logical Foundations of Computer Science, 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 1997, Proceedings, Lecture Notes in Computer Science, Volume 1234, pages 3343. Springer-Verlag, Berlin.
46. Castro-Company, F., Romaguera, S., Sanchez- Alvarez, J., and Tirado, P. (2007). A quasimetric lattice approach for access prediction in replicated database protocols. Technical report, In- stituto de Matemaatica Pura y Aplicada, Universidad Politaecnica de Valencia, Spain.
47. Cavedon, L. (1989). Continuity, consistency, and completeness properties for logic programs. In Levi, G. and Martelli, M., editors, Proceedings of the 6th International Conference on Logic Programming, pages 571-584. MIT Press, Cambridge, MA.
48. Cavedon, L. (1991). Acyclic programs and the completeness of SLDNF-resolution. Theoretical Computer Science, 86:81-92.
49. Cherchago, N., Hitzler, P., and Holldobler, S. (2007). Decidability under the well-founded semantics. In Marchiori, M., Pan, J. Z., and de Sainte Marie, C., editors, Web Reasoning and Rule Systems, First International Conference, RR 2007, Innsbruck, Austria, June 78, 2007, Proceedings, Lecture Notes in Computer Science, Volume 4524, pages 269-278. Springer, Berlin.
50. Clark, K. L. (1978). Negation as failure. In Gallaire, H. and Minker, J., editors, Logic and Data Bases, pages 293-322. Plenum Press, New York.
51. Clifford, E. and Seda, A. K. (2000). Uniqueness of the fixed points of single-step operators in many-valued logics. Journal of Electrical Engineering, Slovak Academy of Sciences, 51(12/s):54-58.
52. Colmerauer, A. and Roussel, P. (1993). The birth of Prolog. In ACM SIGPLAN Notices, Volume 28(3), pages 37-52. ACM Press, New York.
53. Crazzolara, F. (1997). Quasimetric spaces as domains for abstract interpretation. In Falaschi, M., Navarro, M., and Policriti, A., editors, Proceedings of the 1997 Joint Conference on Declarative Programming, APPIA-GULP-PRODE'97, Grado, Italy, June, 1997, pages 45-56. University of Udine, Italy.
54. Cybenko, G. (1989). Approximation by superpositions of a sigmoidal function. Mathematics of Control, Signals, and Systems, 2:303314.
55. Davey, B. A. and Priestley, H. A. (2002). Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK, second edition.
56. d'Avila Garcez, A. S. and Lamb, L. C. (2006). A connectionist computational model for epistemic and temporal reasoning. Neural Computation, 18(7):1711-1738.
57. d'Avila Garcez, A. S. and Zaverucha, G. (1999). The connectionist inductive learning and logic programming system. Applied Intelligence, Special Issue on Neural Networks and Structured Knowledge, 11(1):59-77.
58. d'Avila Garcez, A. S., Zaverucha, G., and de Carvalho, L. A. (1997). Logical inference and inductive learning in artificial neural networks. In Hermann, C., Reine, F., and Strohmaier, A., editors, Knowledge Representation in Neural Networks, pages 33-46. Logos Verlag, Berlin.
59. d'Avila Garcez, A. S., Broda, K. B., and Gabbay, D. M. (2002). Neural-Symbolic Learning Systems - Foundations and Applications. Perspectives in Neural Computing. Springer, Berlin.
60. d'Avila Garcez, A. S., Lamb, L. C., and Gabbay, D. M. (2006). Connectionist computations of intuitionistic reasoning. Theoretical Computer Science, 358(1):34-55.
61. d'Avila Garcez, A. S., Lamb, L. C., and Gabbay, D. M. (2007). Connectionist modal logic: Representing modalities in neural networks. Theoretical Computer Science, 371(1):34-53.
62. d'Avila Garcez, A. S., Lamb, L. C., and Gabbay, D.M. (2009). Neural-Symbolic Cognitive Reasoning. Cognitive Technologies. Springer, Berlin.
63. de Bakker, J. W. (2002). Fixed points in metric semantics. Electronic Notes in Theoretical Computer Science, 40:70-71.
64. de Bakker, J. W. and de Vink, E. P. (1996). Control Flow Semantics. Foundations of Computing Series. MIT Press, Cambridge, MA.
65. De Raedt, L., Frasconi, P., Kersting, K., and Mug-gleton, S., editors (2008). Probabilistic Inductive Logic Programming: Theory and Applications. Springer-Verlag, Berlin.
66. Dowling, W. F. and Gallier, J. H. (1984). Lineartime algorithms for testing the satisfiability of propositional Horn formulae. The Journal of Logic Programming, 1(3):267-284.
67. Dragovich, B. and Dragovich, A. (2006). A p-adic model of DNA sequence and genetic code. Preprint is available at http://www.arxiv.org/abs/q-bio.GN/0607018.
68. Dugundji, J. and Granas, A. (1982). Fixed Point Theory. Monografie Matematyczne. Polish Scientific Publishers, Warsaw.
69. Dung, P. M. and Kanchanasut, K. (1989). A fixpoint approach to declarative semantics of logic programs. In Lusk, E.L. and Overbeek, R. A., editors, Logic Programming, Proceedings of the North American Conference 1989, NACLP'89, Cleveland, Ohio, pages 604-625. MIT Press, Cambridge, MA.
70. Edalat, A. and Heckmann, R. (1998). A computational model for metric spaces. Theoretical Computer Science, 193:53-73.
71. Fages, F. (1994). Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60.
72. Ferry, A. P. (1994). Topological Characterizations for Logic Programming Semantics. PhD thesis, University of Michigan, MI.
73. Fitting, M. C. (1985). A Kripke-Kleene semantics for general logic programs. The Journal of Logic Programming, 2:295-312.
74. Fitting, M. C. (1991). Bilattices and the semantics of logic programming. The Journal of Logic Programming, 11:91-116.
75. Fitting, M. C. (1994a). Kleene's three-valued logics and their children. Fundamenta Informaticae, 20:113-131.
76. Fitting, M. C. (1994b). Metric methods: Three examples and a theorem. The Journal of Logic Programming, 21(3):113-127.
77. Fitting, M. C. (2002). Fixpoint semantics for logic programming - A survey. Theoretical Computer Science, 278(1-2):25-51.
78. Fitting, M. C. and Ben-Jacob, M. (1990). Stratified, weak stratified, and three-valued semantics. Fundamenta Informaticae, 13:19-33.
79. Flagg, B. and Kopperman, R. (1997). Continuity spaces: Reconciling domains and metric spaces. Theoretical Computer Science, 177(1):111-138.
80. Fritzke, B. (1998). Vektorbasierte Neuronale Netze. Habilitation, Technische Universitat Dresden, Germany.
81. Fu, L. (1994). Neural Networks in Computer Intelligence. McGrawHill, New York.
82. Funahashi, K.-I. (1989). On the approximate realization of continuous mappings by neural networks. Neural Networks, 2:183-192.
83. Gabbay, D. M., Hogger, C. J., and Robinson, J. A. (1994). Non-Monotonic Reasoning and Uncertain Reasoning, Volume 3 of Handbook of Logic in Artificial Intelligence and Logic Programming. Clarendon Press, Oxford University Press, Oxford, UK.
84. Ganter, B. and Wille, R. (1999). Formal Concept Analysis: Mathematical Foundations. Springer, Berlin.
85. Gelfond, M. and Lifschitz, V. (1988). The stable model semantics for logic programming. In Kowalski, R. A. and Bowen, K. A., editors, Logic Programming. Proceedings of the 5th International Conference and Symposium on Logic Programming, pages 1070- 1080. MIT Press, Cambridge, MA.
86. Gelfond, M. and Lifschitz, V. (1991). Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385.
87. Gierz, G., Hofmann, K. H., Keimel, K., Lawson, J. D., Mislove, M., and Scott, D. S. (2003). Continuous Lattices and Domains, Volume 93 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, UK.
88. Gust, H., Kühnberger, K.-U., and Geibel, P. (2007). Learning models of predicate logical theories with neural networks based on topos theory. In Hammer, B. and Hitzler, P., editors, Perspectives of Neural-Symbolic Integration, Volume 77 of Studies in Computational Intelligence, pages 233-264. Springer, Berlin.
89. Halmos, P. R. (1998). Naive Set Theory. Undergraduate Texts in Mathematics. Springer-Verlag, Berlin.
90. Hammer, B. and Hitzler, P., editors (2007). Perspectives of Neural-Symbolic Integration, Volume 77 of Studies in Computational Intelligence. Springer, Berlin.
91. Haykin, S. (1994). Neural Networks. A Comprehensive Foundation. Macmillan College Publishing Company, New York.
92. Heckmann, R. (1999). Approximation of metric spaces by partial metric spaces. Applied Categorical Structures, 7:71-83.
93. Heckmanns, U. (1996). On the topology of ultrametric spaces. In Simon, P., editor, Proceedings of the 8th Prague Topological Symposium, August 1996, Prague, pages 149-156. Charles University and Topology Atlas, Prague.
94. Heinze, R. (2003). Topological investigations of the operators of the well-founded and alternating fixed-point semantics of normal logic programs. In Hurley, T., MacanAirchinnigh, M., Schellekens, M., and Seda, A. K., editors, Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT2002), July, 2002, Galway, Ireland, Volume 74 of Electronic Notes in Theoretical Computer Science, pages 51-68. Elsevier Science Publishers, Amsterdam; New York.
95. Hertz, J., Krogh, A., and Palmer, R. G. (1991). Introduction to the Theory of Neural Computation. Addison-Wesley, Reading, MA.
96. Hitzler, P. (2001). Generalized Metrics and Topology in Logic Programming Semantics. PhD thesis, Department of Mathematics, National University of Ireland, University College Cork, Cork, Ireland.
97. Hitzler, P. (2003a). A resolution theorem for algebraic domains. In Gottlob, G. and Walsh, T., editors, Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August, 2003, pages 1339-1340. Morgan Kaufmann Publishers, San Mateo, CA.
98. Hitzler, P. (2003b). Towards a systematic account of different logic programming semantics. In Günter, A., Kruse, R., and Neumann, B., editors, Proceedings of the 26th German Conference on Artificial Intelligence, KI2003, Hamburg, Germany, September, 2003, Lecture Notes in Artificial Intelligence, Volume 2821, pages 105-119. Springer, Berlin.
99. Hitzler, P. (2004). Default reasoning over domains and concept hierarchies. In Biundo, S., Frühwirth, T., and Palm, G., editors, KI2004: Advances in Artificial Intelligence. Proceedings of the 27th Annual German Conference on AI, KI2004, Ulm, Germany, September, 2004, Lecture Notes in Artificial Intelligence, Volume 3238, pages 351365. Springer-Verlag, Berlin.
100. Hitzler, P. (2005). Towards a systematic account of different semantics for logic programs. Journal of Logic and Computation, 15(3):391-404.
101. Hitzler, P. (2009). Towards reasoning pragmatics. In Janowicz, K., Raubal, M., and Levashkin, S., editors, GeoSpatial Semantics, Third International Conference, GeoS 2009, Mexico City, Mexico, December 34, 2009. Proceedings, Lecture Notes in Computer Science, Volume 5892, pages 9-25. Springer, Berlin.
102. Hitzler, P. and Krützsch, M. (2006). Querying formal contexts with answer set programs. In Schürfe, H., Hitzler, P., and 0hrstr0m, P., editors, Conceptual Structures: Inspiration and Application, Proceedings of the 14th International Conference on Conceptual Structures, ICCS 2006, Aalborg, Denmark, July, 2006, Lecture Notes in Artificial Intelligence, Volume 4068, pages 413-426. Springer, Berlin.
103. Hitzler, P. and Kühnberger, K.-U. (2009). The importance of being neural-symbolic - A wilde position. In Go- ertzel, B., Hitzler, P., and Hutter, M., editors, Artificial General Intelligence. Second Conference on Artificial General Intelligence, AGI 2009, Arlington, Virginia, USA, March 6-9, 2009. Proceedings, pages 208-209. Atlantis Press, Amsterdam; Paris.
104. Hitzler, P. and Seda, A. K. (1999a). Acceptable programs revisited. In Etalle, S. and Smaus, J.-G., editors, Proceedings of the Workshop on Verification in Logic Programming, 16th International Conference on Logic Programming, ICLP'99, Las Cruces, New Mexico, November, 1999, Electronic Notes in Theoretical Computer Science, Volume 30, pages 59-76. Elsevier Science Publishers, Amsterdam; New York.
105. Hitzler, P. and Seda, A. K. (1999b). Characterizations of classes of programs by three-valued operators. In Gelfond, M., Leone, N., and Pfeifer, G., editors, Logic Programming and NonMonotonic Reasoning, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'99), El Paso, Texas, USA, December, 1999, Lecture Notes in Artificial Intelligence, Volume 1730, pages 357-371. Springer, Berlin.
106. Hitzler, P. and Seda, A. K. (1999c). Some issues concerning fixed points in computational logic: Quasimetrics, multivalued mappings and the Knaster-Tarski theorem. In Comfort, W., Heckmann, R., Kopperman, R., and Narici, L., editors, Proceedings of the 1fth Summer Conference on Topology and Its Applications: Special Session on Topology in Computer Science, Long Island, USA, Volume 24 of Topology Proceedings, pages 223-250.
107. Hitzler, P. and Seda, A. K. (2000). Dislocated topologies. Journal of Electrical Engineering, Slovak Academy of Sciences, 51(12/s):3-7.
108. Hitzler, P. and Seda, A. K. (2001). A "converse" of the Banach contraction mapping theorem. Journal of Electrical Engineering, Slovak Academy of Sciences, 52(10/s):3-6.
109. Hitzler, P. and Seda, A. K. (2002a). The fixed- point theorems of Priess-Crampe and Ribenboim in logic programming. In Kuhlmann, F.-V., Kuhlmann, S., and Marshall, M., editors, Valuation Theory and Its Applications, Proceedings of the International Valuation Theory Conference, University of Saskatchewan in Saskatoon, Canada, July, 1999, Volume 32 of Fields Institute Communications Series, pages 219-235. American Mathematical Society, Providence, RI.
110. Hitzler, P. and Seda, A. K. (2002b). On the coincidence of semantics for uniquely determined programs. In Hurley, T., MacanAirchinnigh, M., Schellekens, M., and Seda, A. K., editors, Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT2000), Cork, Ireland, July, 2000, Electronic Notes in Theoretical Computer Science, Volume 40, pages 189-205. Elsevier Science Publishers, Amsterdam; New York.
111. Hitzler, P. and Seda, A. K. (2003). Generalized metrics and uniquely determined logic programs. Theoretical Computer Science, 305(1-3):187-219.
112. Hitzler, P. and van Harmelen, F. (2010). A reasonable Semantic Web. Semantic Web - Interoperability, Usability, Applicability. In press.
113. Hitzler, P. and Wendt, M. (2002). The well- founded semantics is a stratified Fitting semantics. In Jarke, M., Koehler, J., and Lakemeyer, G., editors, Proceedings of the 25th Annual German Conference on Artificial Intelligence, KI2002, Aachen, Germany, September 2002, Lecture Notes in Artificial Intelligence, Volume 2479, pages 205-221. Springer, Berlin.
114. Hitzler, P. and Wendt, M. (2003). Formal concept analysis and resolution in algebraic domains. In de Moor, A. and Ganter, B., editors, Using Conceptual Structures - Contributions to ICCS 2003, pages 157-170. Shaker Verlag, Aachen.
115. Hitzler, P. and Wendt, M. (2005). A uniform approach to logic programming semantics. Theory and Practice of Logic Programming, 5(1-2):123-159.
116. Hitzler, P., Holldobler, S., and Seda, A. K. (2004). Logic programs and connectionist networks. Journal of Applied Logic, 2(3):245-272.
117. Hitzler, P., Bader, S., and d'Avila Garcez, A. (2005). Ontology learning as a use case for neural-symbolic integration. In d'Avila Garcez, A. S., Hitzler, P., and Ellman, J., editors, Proceedings of the IJCAI-05 Workshop on Neural-Symbolic Learning and Reasoning, NeSy'05.
118. Hitzler, P., Krotzsch, M., Parsia, B., Patel-Schneider, P., and Rudolph, S., editors (2009a). OWL 2 Web Ontology Language: Primer. W3C Recommendation, 27 October 2009. Preprint can be obtained from the website http://www.w3.org/TR/owl-primer.
119. Hitzler, P., Krotzsch, M., and Rudolph, S. (2009b). Foundations of Semantic Web Technologies. Chapman & Hall/CRC, Boca Raton, FL.
120. Hodel, R. E. (1995). Introduction to Mathematical Logic. Thomson Learning PWS, New York.
121. Holldobler, S. and Kalinke, Y. (1994). Towards a massively parallel computational model for logic programming. In Proceedings ECAI94 Workshop on Combining Symbolic and Connectionist Processing, Amsterdam, July, 1994, pages 68-77. European Coordinating Committee for Artificial Intelligence (ECCAI).
122. Holldobler, S. and Ramli, C. D. P. K. (2009). Logics and networks for human reasoning. In Alippi, C., Polycarpou, M. M., Panayiotou, C. G., and Ellinas, G., editors, Artificial Neural Networks (ICANN 2009), 19th International Conference, Limassol, Cyprus, September 14-17, 2009, Proceedings, Lecture Notes in Computer Science, Volume 5769, pages 85-94. Springer, Berlin.
123. Holldobler, S., Kalinke, Y., and Storr, H.-P. (1999). Approximating the semantics of logic programs by recurrent neural networks. Applied Intelligence, 11:45-58.
124. Hornik, K., Stinchcombe, M., and White, H. (1989). Multilayer feedforward networks are universal approximators. Neural Networks, 2:359-366.
125. Istratescu, V. I. (1981). Fixed Point Theory - An Introduction, Volume 7, Mathematics and Its Applications. D. Reidel Publishing Company, Dordrecht, Holland.
126. Jachymski, J. (2000). A short proof of the converse of the contraction principle and some related results. Topological Methods in Nonlinear Analysis, 15:179-186.
127. Jachymski, J. (2001). Order-theoretic aspects of metric fixed-point theory. In Kirk, W. A. and Sims, B., editors, Handbook of Metric Fixed Point Theory, pages 613-641. Kluwer Academic Publishers, Dordrecht, The Netherlands.
128. Jacobsson, H. (2005). Rule extraction from recurrent neural networks: A taxonomy and review. Neural Computation, 17(6):1223-1263.
129. Jones, N. D. and Laaser, W. T. (1977). Complete problems for deterministic sequential time. Theoretical Computer Science, 3:105-117.
130. Kalinke, Y. (1994). Ein massiv paralleles Berechnungsmodell für normale logische Programme. PhD thesis, Department of Computer Science, Dresden University of Technology, Dresden, Germany.
131. Karp, R. M. and Ramachandran, V. (1990). Parallel algorithms for shared-memory machines. In van Leeuwen, J., editor, Handbook of Theoretical Computer Science, Chapter 17, pages 869-941. Elsevier Science Publishers, New York.
132. Kelley, J. L. (1975). General Topology. Graduate Texts in Mathematics, Volume 27. Springer-Verlag, Berlin.
133. Khamsi, M. A. and Misane, D. (1997/1998). Disjunctive signed logic programs. Fundamenta Informaticae, 32(3-4):349-357.
134. Khamsi, M. A., Kreinovich, V., and Misane, D. (1993). A new method of proving the existence of answer sets for disjunctive logic programs: A metric fixed-point theorem for multivalued mappings. In Baral, C. and Gelfond, M., editors, Proceedings of the Workshop on Logic Programming with Incomplete Information, Vancouver, B. C., Canada, pages 58-73. University of British Columbia, Vancouver, BC.
135. Khrennikov, A. Y. (1998). Human subconscious as the p-adic dynamical system. Journal of Theoretical Biology, 193:179-196.
136. Khrennikov, A. Y. (2004). Information Dynamics in Cognitive, Psychological, Social and Anomalous Phenomena, Volume 138 of Fundamental Theories of Physics. Kluwer Academic Publishers, Dordrecht, Boston, London.
137. Khrennikov, A. Y. and Kozyrev, S. V. (2007). Genetic codenext term on the diadic plane. Physica A: Statistical Mechanics and Its Applications, 381:265-272.
138. Kifer, M., Lausen, G., and Wu, J. (1995). Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4):741-843.
139. Kirk, W. A. and Sims, B., editors (2001). Handbook of Metric Fixed Point Theory. Kluwer Academic Publishers, Dordrecht, The Netherlands.
140. Klavins, E., Rounds, W. C., and Zhang, G.-Q. (1998). Experimenting with power default reasoning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, AAAI 98, IAAI 98, July, 1998, Madison, Wisconsin, USA, pages 846-852. AAAI Press/MIT Press.
141. Knorr, M. and Hitzler, P. (2007). A comparison of disjunctive well-founded semantics. In Hitzler, P., Roth-Berghofer, T., and Rudolph, S., editors, Foundations of Artificial Intelligence FAInt 2007, Osnabrück, Germany, September 10, 2007, Volume 277, CEUR Workshop Proceedings.
142. Kohonen, T. (1981). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43(1):59-69.
143. Komendantskaya, E. (2010). Unification neural networks: Unification by error-correction learning. Logic Journal of the IGPL. In press.
144. Komendantskaya, E., Lane, M., and Seda, A. K. (2007). Connectionist representation of multivalued logic programs. In Hammer, B. and Hitzler, P., editors, Perspectives of Neural-Symbolic Integration, Volume 77 of Studies in Computational Intelligence, pages 283-313. Springer, Berlin.
145. Kopperman, R. (1988). All topologies come from generalized metrics. American Mathematical Monthly, 95(2):89-97.
146. Kowalski, R. A. (1974). Predicate logic as a programming language. In Rosenfeld, J. L., editor, Proceedings IFIP'74, Stockholm, Sweden, August, 1974, pages 569-574. North-Holland, Amsterdam.
147. Krotzsch, M. (2006). Generalized ultrametric spaces in quantitative domain theory. Theoretical Computer Science, 368(1-2):30-49.
148. Krotzsch, M., Rudolph, S., and Hitzler, P. (2008). ELP: Tractable rules for OWL 2. In Sheth, A., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., and Thirunarayan, K., editors, Proceedings of the 7th International Semantic Web Conference (ISWC- 08), Lecture Notes in Computer Science, Volume 5318, pages 649-664. Springer, Berlin.
149. Kuhlmann, F.-V. (1999). A theorem about maps on spherically complete ultrametric spaces, and its applications. Preprint, Department of Mathematics and Statistics, University of Saskatchewan in Saskatoon, 20 pages.
150. Künzi, H.-P. A. (2001). Non-symmetric distances and their associated topologies: About the origins of basic ideas in the area of asymmetric topology. In Aull, C. E. and Lowen, R., editors, Handbook of the History of General Topology, Volume 3, pages 853-968. Kluwer Academic Publishers, Dordrecht.
151. Künzi, H.-P. A. and Kivuvu, C. M. (2008). A double completion for an arbitrary To-quasimetric space. Journal of Logic and Algebraic Programming, 76(2):251-269.
152. Künzi, H.-P. A., Pajoohesh, H., and Schellekens, M. (2006). Partial quasimetrics. Theoretical Computer Science, 365:237246.
153. Lane, M. and Seda, A. K. (2006). Some aspects of the integration of connectionist and logic-based systems. Information, 9(4):551-562.
154. Lane, M. and Seda, A. K. (2009). Properties of general semantic operators determined by logic-based systems. In Hurley, T., MacanAirchinnigh, M., Schellekens, M., Seda, A. K., and Strong, G., editors, Proceedings of the Fourth Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFC- SIT2006), University College Cork, August, 2006, Electronic Notes in Theoretical Computer Science, Volume 225, pages 181-194. Elsevier Science Publishers, Amsterdam; New York.
155. Lassez, J.-L., Nguyen, V., and Sonenberg, L. (1982). Fixed-point theorems and semantics: A folk tale. Information Processing Letters, 14(3):112-116.
156. Lehmann, J., Bader, S., and Hitzler, P. (2010). Extracting reduced logic programs from artificial neural networks. Applied Intelligence, 32(3):249-266.
157. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., and Scarcello, F. (2006). The dlv system for knowledge representation and reasoning. ACM Transactions on Computational Logics, 7(3):499-562.
158. Lifschitz, V. (1999). Answer set planning. In Schreye, D. D., editor, Logic Programming. Proceedings of the 16th International Conference on Logic Programming, ICLP'99, Las Cruces, New Mexico, November, 1999, pages 23-37. MIT Press, Cambridge, MA.
159. Lifschitz, V. (2001). Success of default logic. In Hayes, P., Sandewall, E., Amarel, S., et al., editors, Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter, pages 208-212. Springer-Verlag, New York, Secaucus, NJ.
160. Lifschitz, V., McCain, N., Przymusinski, T. C., and Stärk, R. F. (1995). Loop checking and the well-founded semantics. In Marek, V. W. and Nerode, A., editors, Logic Programming and NonMonotonic Reasoning, Proceedings of the 3rd International Conference, LPNMR'95, Lexington, KY, USA, June 1995, Lecture Notes in Computer Science, Volume 928, pages 127-142. Springer, Berlin.
161. Lloyd, J. W. (1987). Foundations of Logic Programming, Second Edition. Springer, Berlin.
162. Makinson, D. (2005). Bridges from Classical to NonMonotonic Logic. King's College Publications, London.
163. Marchiori, E. (1996). On termination of general logic programs with respect to constructive negation. The Journal of Logic Programming, 26(1):69-89.
164. Marek, V. W. and Truszczynski, M. (1999). Stable models and an alternative logic programming paradigm. In Apt, K. R., Marek, V. W., Truszczynski, M., and Warren, D. S., editors, The Logic Programming Paradigm: A 25-Year Perspective, pages 375-398. Springer, Berlin.
165. Markowsky, G. (1976). Chain-complete posets and directed sets with applications. Algebra Universalis, 6:53-68.
166. Martin, K. (2000). A Foundation for Computation. PhD thesis, Department of Mathematics, Tulane University, New Orleans, LA.
167. Martinetz, T. and Schulten, K. (1991). A "Neural-Gas" network learns topologies. Artificial Neural Networks, I:397-402.
168. Matthews, S. G. (1986). Metric domains for completeness. Technical Report 76, Department of Computer Science, University of Warwick, Coventry, UK. Ph.D. Thesis, 1985.
169. Matthews, S. G. (1992). The cycle contraction mapping theorem. Technical Report 228, Department of Computer Science, University of Warwick, Coventry, UK.
170. Matthews, S. G. (1994). Partial metric topology. In Andima, S., Itzkowitz, G., Kong, Y., et al., editors, Proceedings of the Eighth Summer Conference on General Topology and Its Applications, Queens College, CUNY, New York, USA, June, 1992, Annals of the New York Academy of Sciences, Volume 728, pages 183-197. New York Academy of Sciences, New York.
171. McCarthy, J. (1977). Epistemological problems of artificial intelligence. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-77), pages 1038-1044.
172. McCarthy, J. (1980). Circumscription - A form of nonmonotonic reasoning. Artificial Intelligence, 13(1):27-39.
173. Mendelson, E. (1987). Introduction to Mathematical Logic. Wadsworth & Brooks/Cole Advanced Books and Software, Monterey, CA.
174. Moore, R. (1984). Possible-worlds semantics for autoepistemic logic. In Proceedings of the 1984 Non-Monotonic Reasoning Workshop. AAAI, Menlo Park, CA.
175. Moore, R. (1985). Semantical considerations on non-monotonic logic. Artificial Intelligence, 25(1):75-94.
176. Murtagh, F. (2004). On ultrametricity, data coding, and computation. Journal of Classification, 21:167-184.
177. Murtagh, F. (2005). Identifying the ultrametricity of time series. European Physical Journal, 43(4):573-579.
178. O'Neill, S. J. (1996). Partial metrics, valuations, and domain theory. In Andima, S., Flagg, R., Itzkowitz, G., et al., editors, Papers on General Topology and Applications: Eleventh Summer Conference on General Topology and Applications, University of Southern Maine, Maine, August, 1996, Annals of the New York Academy of Sciences, pages 304-315. New York Academy of Sciences, New York.
179. Pedreschi, D., Ruggieri, S., and Smaus, J.-G. (2002). Classes of terminating logic programs. Theory and Practice of Logic Programming, 2(3):369-418.
180. Plotkin, G. D. (1983). Domains. Department of Computer Science, University of Edinburgh, Scotland.
181. Prieb-Crampe, S. (1990). Der Banachsche Fixpunktsatz für ultrametrische Räume. Results in Mathematics, 18:178-186.
182. Prieb-Crampe, S. and Ribenboim, P. (1993). Fixed points, combs and generalized power series. Abh. Math. Sem. Univ. Hamburg, 63:227-244.
183. Prieb-Crampe, S. and Ribenboim, P. (2000a). Fixed-point and attractor theorems for ultrametric spaces. Forum Mathematicum., 12:53-64.
184. Prieb-Crampe, S. and Ribenboim, P. (2000b). Logic programming and ultrametric spaces. Rendiconti di Math- ematica, VII:1-13.
185. Prieb-Crampe, S. and Ribenboim, P. (2000c). Ultrametric spaces and logic programming. The Journal of Logic Programming, 42:59-70.
186. Przymusinska, H. and Przymusinski, T. C. (1990). Weakly stratified logic programs. Fundamenta Informati- cae, 13:51-65.
187. Przymusinski, T. C. (1988). On the declarative semantics of deductive databases and logic programs. In Minker, J., editor, Foundations of Deductive Databases and Logic Programming, pages 193216. Morgan Kaufmann Publishers, Los Altos, CA.
188. Reed, G. M., Roscoe, A. W., and Wachter, R. F., editors (1991). Topology and Category Theory in Computer Science. Oxford University Press, Oxford, UK.
189. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13:81-132.
190. Reynolds, D., editor (2010). OWL 2 RL in RIF. A W3C Working Group Note. See http://www.w3.org/TR/rif-owl-rl/.
191. Ribenboim, P. (1996). The new theory of ultrametric spaces. Periodica Mathematical Hungarica, 32(1-2):103-111.
192. Robinson, J. A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41.
193. Rodriguez-Lopez, J., Romaguera, S., and Valero, O. (2008). Denotational semantics for programming languages, balanced quasimetrics and fixed points. International Journal of Computer Mathematics, 85(3):623-630.
194. Rojas, R. (1996). Neural Networks. Springer, Berlin.
195. Romaguera, S. and Schellekens, M. (2003). Norm-weightable Riesz spaces and the dual complexity space. In Hurley, T., MacanAirchinnigh, M., Schellekens, M., and Seda, A. K., editors, Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFC- SIT2002), Galway, Ireland, July, 2002, Electronic Notes in Theoretical Computer Science, Volume 74, pages 1-17. Elsevier Science Publishers, Amsterdam; New York.
196. Rounds, W. C. and Zhang, G.-Q. (2001). Clausal logic and logic programming in algebraic domains. Information and Computation, 171(2):156-182.
197. Rumelhart, D. E., Hinton, G. E., and Williams., R. J. (1986). Learning internal representations by error propagation. In McClelland, J. L. and Rumelhart, D. E., editors, Parallel Distributed Processing, pages 318-362. MIT Press, Cambridge, MA.
198. Rutten, J. J. (1995). Elements of generalized ultrametric domain theory. Technical Report CS-R9507, CWI, Stichting Mathematisch Centrum, Amsterdam, The Netherlands.
199. Rutten, J. J. (1996). Elements of generalized ultrametric domain theory. Theoretical Computer Science, 170:349-381. Revised version of [Rutten, 1995].
200. Scott, D. S. (1982a). Domains for denotational semantics. In Nielsen, M. and Schmidt, E. M., editors, Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings, Lecture Notes in Computer Science, Volume 140, pages 577-613. Springer, Berlin.
201. Scott, D. S. (1982b). Lecture notes on a mathematical theory of computation. In Broy, M. and Schmidt, G., editors, Theoretical Foundations of Programming Methodology, pages 145-292. Reidel, Dordrecht.
202. Scutellà, M. G. (1990). A note on Dowling and Gallier's top- down algorithm for propositional Horn satisfiability. The Journal of Logic Programming, 8:265-273.
203. Seda, A. K. (1995). Topology and the semantics of logic programs. Fundamenta Informaticae, 24(4):359-386.
204. Seda, A. K. (1997). Quasimetrics and the semantics of logic programs. Fundamenta Informaticae, 29(1):97-117.
205. Seda, A. K. (2002). Some convergence issues in theoretical computer science. Information, 5(4):447-462.
206. Seda, A. K. (2006). On the integration of connectionist and logic-based systems. In Hurley, T., MacanAirchinnigh, M., Schellekens, M., Seda, A. K., and Strong, G., editors, Proceedings of the Third Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT2004), Trinity College Dublin, Ireland, July, 2004, Electronic Notes in Theoretical Computer Science, Volume 161, pages 109-130. Elsevier Science Publishers, Amsterdam; New York.
207. Seda, A. K. (2007). Morphisms of ANN and the computation of least fixed points of semantic operators. In Mira, J. and Alvarez, J. R., editors, Proceedings of the Second International Work-Conference on the Interplay Between Natural and Artificial Computation (IWINAC2007), Murcia, Spain, June, 2007, Part 1, Lecture Notes in Computer Science, Volume 4527, pages 224-233. Springer, Berlin.
208. Seda, A. K. and Hitzler, P. (1999a). Strictly level- decreasing logic programs. In Butterfield, A. and Flynn, S., editors, Proceedings of the Second Irish Workshop on Formal Methods (IWFM'98), NUI, Cork, Ireland, July, 1998, Electronic Workshops in Computing, pages 1-18. British Computer Society, Swindon, UK.
209. Seda, A. K. and Hitzler, P. (1999b). Topology and iterates in computational logic. In Flagg, R., Hart, K., Norden, J., Tym- chatyn, E., and Tuncali, M., editors, Proceedings of the 12th Summer Conference on Topology and Its Applications: Special Session on Topology in Computer Science, Ontario, Canada, August, 1997, Volume 22 of Topology Proceedings, pages 427-469.
210. Seda, A. K. and Hitzler, P. (2010). Generalized distance functions in the theory of computation. The Computer Journal, 53(4):443-464.
211. Seda, A. K. and Lane, M. (2003). On continuous models of computation: Towards computing the distance between (logic) programs. In Morris, J., Aziz, B., and Oehl, F., editors, Proceedings of the Sixth International Workshop in Formal Methods (IWFM'03), Dublin City University, Dublin, Ireland, July, 2003, Electronic Workshops in Computing, pages 1-15. British Computer Society, Swindon, UK.
212. Seda, A. K. and Lane, M. (2005). On the measurability of the semantic operators determined by logic programs. Information, 8(1):33-52.
213. Seda, A. K., Heinze, R., and Hitzler, P. (2003). Convergence classes and spaces of partial functions. In Domain Theory, Logic and Computation. Proceedings of the 2nd International Symposium on Domain Theory, ISDT (2001), Sichuan University, Chengdu, China, October, 2001, Semantic Structures in Computation, Volume 3, pages 75115. Kluwer Academic Publishers, Dordrecht, The Netherlands.
214. Simons, P., Niemelä, I., and Soininen, T. (2002). Extending and implementing the stable model semantics. Artificial Intelligence, 138:181-234.
215. Smyth, M. B. (1987). Quasi uniformities: Reconciling domains with metric spaces. In Main, M. G., Melton, A., Mislove, M. W., and Schmidt, D. A., editors, Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science, Volume 198, pages 236-253. Springer, Berlin.
216. Smyth, M. B. (1991). Totally bounded spaces and compact ordered spaces as domains of computation. In Reed, G. M., Roscoe, A. W., and Wachter, R. F., editors, Topology and Category Theory in Computer Science, pages 207-229. Oxford University Press, Oxford, UK.
217. Smyth, M. B. (1992). Topology. In Abramsky, S., Gabbay, D. M., and Maibaum, T. S., editors, Handbook of Logic in Computer Science Volume 1, pages 641-761. Oxford University Press, Oxford, UK.
218. Stoltenberg-Hansen, V., Lindström, I., and Griffor, E. R. (1994). Mathematical Theory of Domains. Cambridge Tracts in Theoretical Computer Science No. 22. Cambridge University Press, Cambridge, UK.
219. Straccia, U., Ojeda-Aciego, M., and Damasio, C. V. (2009). On fixed points of multivalued functions on complete lattices and their application to generalized logic programs. SIAM Journal of Computing, 38(5):1881-1911.
220. van Emden, M. H. and Kowalski, R. A. (1976). The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733-742.
221. Van Gelder, A., Ross, K. A., and Schlipf, J. S. (1991). The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650.
222. Waszkiewicz, P. (2002). Quantitative Continuous Domains. PhD thesis, School of Computer Science, The University of Birmingham, Edgbaston, Birmingham, UK.
223. Waszkiewicz, P. (2003). Quantitative continuous domains. Applied Categorical Structures, 11(1):41-67.
224. Waszkiewicz, P. (2006). Partial metrizability of continuous posets. Mathematical Structures in Computer Science, 16(2):359-372.
225. Wendt, M. (2002a). Unfolding the well-founded semantics. Technical Report WV-02-08, Knowledge Representation and Reasoning Group, Department of Computer Science, Dresden University of Technology.
226. Wendt, M. (2002b). Unfolding the well-founded semantics. Journal of Electrical Engineering, Slovak Academy of Sciences, 53(12/s):56-59.
227. Willard, S. (1970). General Topology. Addison-Wesley, Reading, MA.
228. Zhang, G.-Q. (1991). Logic of Domains. Birkhauser, Boston.
229. Zhang, G.-Q. and Rounds, W. C. (1997a). Complexity of power default reasoning. In Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science, LICS'97, Warsaw, Poland, pages 328-339. IEEE Computer Society Press.
230. Zhang, G.-Q. and Rounds, W. C. (1997b). Reasoning with power defaults (preliminary report). In Dix, J., Furbach, U., and Nerode, A., editors, Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning (LP- NMR'97), Dagstuhl, Germany, Lecture Notes in Computer Science, Volume 1265, pages 152-169. Springer, Berlin.
231. Zhang, Q.-Z. and Rounds, W. C. (2001). Semantics of logic programs and representation of Smyth powerdomains. In Keimel, K. et al., editors, Domains and Processes, pages 151-179. Kluwer Academic Publishers, Dordrecht, The Netherlands.