Generalized metrics and uniquely determined logic programs

Theoretical Computer Science

Volumn 305, Issue 1-3, 2003, Pages 187-219

  Hitzler, Pascal ^a,b   Seda, Anthony Karel ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Clark completion; Domain theory; Fixed point semantics; Generalized metric; Logic programming

Indexed keywords

HIERARCHICAL SYSTEMS; LOGIC PROGRAMMING; SEMANTICS; SET THEORY; THEOREM PROVING; TOPOLOGY;

GENERALIZED METRICS;

COMPUTER SCIENCE;

EID: 0042029626     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00709-0     Document Type: Conference Paper

References (52)

1. K.R. Apt, H.A. Blair, A. Walker, Towards a theory of declarative knowledge, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 89-148.
2. Apt K.R., Pedreschi D. Reasoning about Termination of Pure Prolog Programs. Inform. Comput. 106:1993;109-157.
3. A. Batarek, Topological aspects of logic programming, Ph.D. Thesis, Syracuse University, June 1989.
4. Batarekh A., Subrahmanian V.S. Topological model set deformations in logic programming. Fundamenta Informaticae. 12(3):1989;357-400.
5. A. Batarekh, V.S. Subrahmanian, The query topology in logic programming, in: Proc. 1989 Symp. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 349, Springer, Berlin, 1989, pp. 375-387.
6. Bezem M. Characterizing termination of logic programs with level mappings. Lusk E.L., Overbeek R.A. Proc. North American Conf. Logic Programming. 1989;69-80 MIT Press, Cambridge, MA.
7. Blair H.A., Dushin F., Jakel D.W., Rivera A.J., Sezgin M. Continuous models of computation for Logic Programs. Apt K.R., Marek V.W., Truszcynski M., Warren D.S. The Logic Programming Paradigm: a 25-Year Perspective. 1999;231-255 Springer, Berlin.
8. H.A. Blair and J. Remmel, Hybrid automata: convergence spaces and continuity, Proc. 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), Orlando, Florida, USA, July, 2001, International Institute of Informatics and Systemics, 2001.
9. Bossi A., Gabbrielli M., Levi G., Martelli M. The. s -semantics approach theory and applications J. Logic Programming. 19&20:1994;149-198.
10. Cavedon L. Acyclic programs and the completeness of SLDNF-resolution. Theoret. Comput. Sci. 86:1991;81-92.
11. Clark K.L. Negation as failure. Gallaire H., Minker J. Logic and Data Bases. 1978;293-322 Plenum Press, New York.
12. Edalat A., Heckmann R. A computational model for metric spaces. Theoret. Comput. Sci. 193:1998;53-73.
13. Fages F. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Gen. Comput. 9:1991;425-443.
14. Fages F. Consistency of Clark's completion and existence of stable models. J. Methods of Logic in Comput. Sci. 1:1994;51-60.
15. Fitting M. A Kripke-Kleene-semantics for general logic programs. J. Logic Programming. 2:1985;295-312.
16. Fitting M. Metric methods. three examples and a theorem J. Logic Programming. 21(3):1994;113-127.
17. Van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. J. ACM. 38(3):1991;620-650.
18. Gelfond G., Lifschitz V. The stable model semantics for logic programming. Kowalski R.A., Bowen K.A. Logic Programming, Proc. 5th Internat. Conf. and Symp. on Logic Programming. 1988;1070-1080 MIT Press, Cambridge, MA.
19. M.A. Gutiérrez Naranjo, J.A. Alonso Jiménez, J. Borrego Díaz, A topological study of the upward refinement operators in ILP, in: J. Cussens, A. Frisch (Eds.), Inductive Logic Programming, 10th Internat. Conf. (ILP2000) work-in-Progress Reports, London, 2000, pp. 120-137.
20. P. Hitzler, Generalized metrics and topology in logic programming semantics, Ph.D. Thesis, Department of Mathematics, National University of Ireland, University College Cork, 2001.
21. Hitzler P., Seda A.K. Characterizations of classes of programs by three-valued operators. Gelfond M., Leone N., Pfeifer G. Logic Programming and Non-Monotonic Reasoning, Proc. 5th Internat. Conf. on Logic Programming and Non-Monotonic Reasoning (LPNMR'99), El Paso, Texas, USA, December 1999. Lecture Notes in Artificial Intelligence. Vol. 1730:1999;357-371 Springer, Berlin.
22. P. Hitzler, A.K. Seda, The fixed-point theorems of Priess-Crampe and Ribenboim in logic programming, in: F.V. Kuhlmann, S. Kuhlmann, M. Marshall (Eds.), Proc. Internat. Conf. Workshop in Valuation Theory in Honour of Paulo Ribenboim, Saskatchewan, Canada, July 1999, Fields Institute Communications Series, Vol. 32, American Mathematical Society, Providence, RJ, 2002, pp. 219-235.
23. P. Hitzler, A.K. Seda, Acceptable programs revisited, Proc. Workshop on Verification in Logic Programming, 16th Internat. Conf. on Logic Programming (ICLP'99), Las Cruces, New Mexico, November, 1999, Electronic Notes in Theoretical Computer Science, Vol. 30, 1, Elsevier, Amsterdam, 1999, pp. 1-18.
24. P. Hitzler, A.K. Seda, Dislocated topologies, Proc. Slovakian Conf. in Applied Mathematics, Bratislava, 2000, J. Electr. Engng, Vol. 51 No. 12/s, Slovak Academy of Sciences, 2000, pp. 3-7.
25. P. Hitzler, A.K. Seda, A new fixed-point theorem for logic programming semantics, Proc. joint IIIS & IEEE meeting of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and the 6th Internat. Conf. on Information Systems Analysis and Synthesis (ISAS2000), Orlando, Florida, USA, July 2000, International Institute of Informatics and Systemics: IIIS, Vol. VII, Computer Science and Engineering Part 1, 2000, pp. 418-423.
26. P. Hitzler, A.K. Seda, A note on the relationships between logic programs and neural networks, in: P. Gibson, D. Sinclair (Eds.), Proc. 4th Irish Workshop on Formal Methods (IWFM'00), Maynooth, July 2000, Electronic Workshops in Computing (eWiC), British Computer Society, Swindon, UK, pp. 1-9.
27. P. Hitzler, A.K. Seda, Unique supported-model classes of logic programs, Information, Vol. 4 (3), International Information Institute, 2001, pp. 295-302.
28. Hitzler P., Seda A.K. On the coincidence of semantics for uniquely determined programs. Hurley T., Mac an Airchinnigh M., Schellekens M., Seda A.K. Proc. First Irish Conf. on the Mathematical Foundations of Computer Science and Information Technology, Cork, Ireland, July 2000. Electronic Notes in Theoretical Computer Science. Vol. 40:2001;1-17 Elsevier, Amsterdam.
29. S. Hölldobler, Challenge problems for the integration of logic and connectionist systems in: F. Bry, U. Geske, D. Seipel (Eds.), Proc. 14th Workshop Logische Programmierung, Würzburg, Germany, January 26-28, 2000, GMD Report 90, 2000, pp. 161-170. This report is available at http://www.gmd.de/publications/report/0090/.
30. Hölldobler S., Störr H., Kalinke Y. Approximating the semantics of logic programs by recurrent neural networks. Appl. Intell. 11:1999;45-58.
31. M.A. Khamsi, V. Kreinovich, D. Misane, A New Method of Proving the Existence of answer sets for disjunctive logic programs: a metric fixed-point theorem for multivalued mappings, in: C. Baral, M. Gelfond (Eds.), Proc. Workshop on logic programming with Incomplete Information, Vancouver, B.C., Canada, October 1993, pp. 58-73.
32. Lloyd J.W. Foundations of Logic Programming. 1988;Springer, Berlin.
33. S.G. Matthews, Metric domains for completeness, Ph.D. Thesis, 1985, Research Report 76, Department of Computer Science, University of Warwick, UK, April, 1986.
34. S.G. Matthews, Partial Metric Topology, in: Proc. 8th Summer Conf. Topology and its Applications, Annals of the New York Academy of Sciences, Vol. 728, 1992, pp. 183-197.
35. Priess-Crampe S., Ribenboim P. Ultrametric spaces and logic programming. J. Logic Programming. 42:2000;59-70.
36. Przymusinski T.C. On the declarative semantics of deductive databases and logic programs. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;193-216 Morgan Kaufmann, Los Altos, CA.
37. H. Przymusinska, T.C. Przymusinski, Weakly stratified logic programs, in: K.R. Apt (Ed.), Fundamenta Informaticae, Vol. 13, 1990, pp. 51-65 (special issue on Logical Foundations of Artificial Intelligence).
38. Reiter R. A logic for default reasoning. Artif. Intell. 13:1980;81-132.
39. Rounds W.C., Zhang G.-Q. Clausal logic and logic programming in algebraic domains. Inform. Comput. 171:2001;183-200.
40. Rutten J.J.M.M. Elements of generalized ultrametric domain theory. Theoret. Comput. Sci. 170:1996;349-381.
41. Seda A.K. Topology and the semantics of logic programs. Fundamenta Informaticae. 24(4):1995;359-386.
42. Seda A.K. Quasi-metrics and the semantics of logic programs. Fundamenta Informaticae. 29(1):1997;97-117.
43. A.K. Seda, P. Hitzler, Topology and iterates in computational logic, Proc. 12th Summer Conf. on Topology and its Applications: Special Session on Topology in Computer Science, Ontario, August 1997; Topology Proceedings, Vol. 22, Summer 1997, pp. 427-469.
44. A.K. Seda, P. Hitzler, Strictly level-decreasing logic programs, in: A. Butterfield, S. Flynn (Eds.), Proc. Second Irish Workshop on Formal Methods (IWFM'98), Cork, 1998, Electronic Workshops in Computing (eWiC), British Computer Society, Swindon, UK, 1999, pp. 1-18.
45. Smyth M.B. Quasi-uniformities: reconciling domains with metric spaces. Main M., Melton A., Mislove M., Schmidt D. Mathematical Foundations of Programming Language Semantics. Lecture Notes in Computer Science. Vol. 198:1987;236-253 Springer, Berlin.
46. Smyth M.B. Totally bounded spaces and compact ordered spaces as domains of computation. Reed G.M., Roscoe A.W., Wachter R.F. Topology and Category Theory in Computer Science. 1991;207-229 Oxford University Press, Oxford.
47. Stoltenberg-Hansen V., Lindström I., Griffor R. Mathematical Theory of Domains. 1994;Cambridge University Press, Cambridge.
48. Willard S. General Topology. 1970;Addison-Wesley, Reading MA.
49. Zhang G.-Q. Logic of Domains. Progress in Theoretical Computer Science. 1991;Birkhäuser, Boston.
50. G.-Q. Zhang, W.C. Rounds, Complexity of power default reasoning, in: Proc. 12th Ann. IEEE Symp. on Logic in Computer Science, LICS'97, Warsaw, Poland, July 1997, IEEE Computer Society Press, Silverspring, MI, pp. 328-339.
51. Zhang G.-Q., Rounds W.C. Power defaults (preliminary report). Dix J., Furbach U., Nerode A. Proc. Fourth Internat. Conf. Logic Programming and Non-Monotonic Reasoning (LPNMR'97), Dagstuhl, Germany, July 28-31, 1997. Lecture Notes in Computer Science. Vol. 1265:1997;152-169 Springer-Verlag, Berlin.
52. Zhang G.-Q., Rounds W.C. Semantics of logic programs and representation of Smyth powerdomain. Keimel K., Zhang G.-Q.et al. Domains and Processes (ISDT'99). Series Semantic Structures in Computation. Vol. 1:2001;151-179 Kluwer Academic Publishers, Dordrecht.