Skip to main content
SpringerLink
Log in

Logic Programming Languages for the Internet

  • Chapter
  • First Online:
Computational Logic: Logic Programming and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2407))

Abstract

We specify the major characteristics of the Internet under the headings: heterogeneity, service characteristics, dynamic nature, no global notions, and unreliability (i.e. security and partial failure). In the process, we identify five categories of Internet services: hosts, active entities, agents, semistructured data, and passive code.

Logic Programming (LP) languages for the Internet are divided into six broad groups: shared variables, coordination, message passing, client-side execution, server-side execution, and integration of heterogeneous data sources. Within each group we attempt to highlight the advantages and disadvantages for Internet programming in terms of our Internet characteristics and services, and describe LP languages that typify the group.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S. 1997. “Querying Semistructured Data”, In Proc. of the Int. Conf. on Database Theory (ICDT), Delphi, Greece, January.

    Google Scholar 

  2. Abiteboul, S., Quass, D., McHugh, J., Widom, J., and Wiener, J. 1997. “The Lorel Query Language for Semistructured Data”, Int. Journal on Digital Libraries, Vol. 1, No. 1, April, pp. 68–88.

    Google Scholar 

  3. Abiteboul, S. and Vianu, V. 1997. “Queries and Computation on the Web”, In Proc. of the Int. Conf. on Database Theory (ICDT), Delphi, Greece, January.

    Google Scholar 

  4. Akama, K. 1993. “Declarative Semantics of Logic Programs on Parameterized Representation Systems”, Advances in Software Science and Technology, Vol. 5, pp. 45–63.

    Google Scholar 

  5. Alkalaj, L., Lang, T., and Ercegovac, M. 1990. “Architectural Support for the Management of Tightly-Coupled, Fine-Grain Goals in Flat Concurrent Prolog”, In Int. Symp. on Computer Architecture, June, pp. 292–301.

    Google Scholar 

  6. Alouini, I. and Van Roy, P. 2000. “Fault Tolerant Mobile Agents in Mozart”, Available at http://www.mozart-oz.org/papers/abstracts/asama2000.html.

  7. Amzi! Prolog. 1996. “Internet and Web Tools”, Available at http://www.amzi.com/internet.htm.

  8. Andreoli, J.-M., Arregui, D., Pacull, F., Riviere, M., Vion-Dury, J-Y., Willam-owski, J. 1999. “CLF/Mekano: A Framework for Building Virtual-Enterprise Applications”, In Proc. of EDOC’99, Mannheim, Germany, September.

    Google Scholar 

  9. Andreoli, J.-M., Ciancarini, P., and Pareschi, R. 1993. “Interaction Abstract Machines”, In Research Directions in Concurrent Object Oriented Programming, G. Agha, P. Wegner, A. Yonezawa (eds.), MIT Press, pp. 257–280.

    Google Scholar 

  10. Andreoli, J-M. and Pareschi, R. 1991. “Linear Objects: Logical Processes with Built-in Inheritance”, New Generation Computing, Vol. 9, Nos. 3–4, pp. 445–473.

    Google Scholar 

  11. Anutariya, C. 1999. “A Declarative Description Data Model for XML Documents”, Dissertation Proposal, CSIM, Asian Institute of Technology, Bangkok, Thailand, September.

    Google Scholar 

  12. Arocena, G.O., Mendelzon, A.O., Mihaila, G.A. 1997. “Applications of a Web Query Language”, In 6th Int. WWW Conf., April, Available at http://atlanta.cs.nchu.edu.tw/www/PAPER267.html.

  13. Aquilino, D., Asirelli, P., Formuso, A., Renso, C., and Turini, F. 2000. “Using MedLan to Integrate Geographical Data”, InSubrahmanian, V.S. (guest editors) 2000. Journal of Logic Programming Special Issue on Logic-based Heterogeneous Information Systems, Vol. 43, No. 1, April [104], pp. 3–14.

    Google Scholar 

  14. Banatre, J.-P., and Le Matayer, D. 1993. “Programming by Multiset Transformations”, Communications of the ACM, Vol. 36, No. 1, January, pp. 98–111.

    Article  Google Scholar 

  15. Banatre, J.-P., and Le Matayer, D. 1996. “Gamma and the Chemical Reaction Model: Ten Years After”, In Coordination Programming: Mechanisms, Models and Semantics, J.-M. Andreoli, C. Hankin, and D. Le Metayer (eds.), Worl Scientific, pp. 1–39.

    Google Scholar 

  16. BinProlog. 2000. “BinProlog Linda Library Manual”, Available at http://www.binnetcorp.com/BinProlog/index.html.

  17. Bonnet, Ph., Bressan, S., Leth, L., and Thomsen, B. 1996. “Towards ECLiPSe Agents on the Internet”, In Proc. of the 1st Workshop on Logic Programming Tools for Internet Applications, P. Tarau, A. Davison, K. De Bosschere, and M. Hermenegildo (eds.), JICSLP’96, September, pp. 1–9.

    Google Scholar 

  18. Brogi, A. and Ciancarini, P. 1991. “The Concurrent Language, Shared Prolog”, ACM Trans. on Programming Languages and Systems, Vol. 13, No. 1, January, pp. 99–123.

    Article  Google Scholar 

  19. Bryce, C., Oriol, M., and Vitek, J. 1999. “A Coordination Model for Agents Based on Secure Spaces”, In Coordination Languages and Models: Coordination 99, Amsterdam, April.

    Google Scholar 

  20. Bucci, A., Ciancarini, P., and Montangero, C. 1991. “Extended Shared Prolog: A Multiple Tuple Spaces Logic Language”, In Proc. 10th Japanese LP Conf., LNCS, Springer-Verlag.

    Google Scholar 

  21. Cabeza, D., Hermenegildo, M., and Varma, S. 1996. “The PiLLoW/CIAO Library for INTERNET/WWW Programming”, In Proc. of the 1st Workshop on Logic Programming Tools for Internet Applications, P. Tarau, A. Davison, K. De Bosschere, and M. Hermenegildo (eds.), JICSLP’96, September, pp. 43–62.

    Google Scholar 

  22. Calejo, M. 1999. “Java+Prolog: A Land of Opportunities”, In PACLP’99: The 1st Int. Conf. on Constraint Technologies and Logic Programming, London, pp. 1–2.

    Google Scholar 

  23. Carriero, N. and Gelernter, D. 1989. “Linda in Context’, Comms. of the ACM, Vol. 32, No. 4, April, pp. 444–458.

    Article  Google Scholar 

  24. Carriero, N., Gelernter, D., and Zuck, L. 1996. “Bauhaus Linda”, In Object-based Models and Languages for Concurrent Systems, P. Ciancarini, O. Nierstrasz, A. Yonezawa (eds.), LNCS 924, Springer-Verlag, July, pp. 66–76.

    Google Scholar 

  25. Cardelli, L. 1999. “Abstractions for Mobile Computation”, In Secure Internet Programming: Security Issues for Mobile and Distributed Objects, J. Vitek and C. Jensen (eds.), LNCS 1603, Springer-Verlag, pp. 51–94.

    Google Scholar 

  26. Cardelli, L. and Gordon, A.D. 1998. “Mobile Ambients”, In FoSSaCS’98, LNCS 1378, Springer-Verlag, pp. 140–155.

    Google Scholar 

  27. Chandy, K.M. and Kesselman, C. 1993. “CC++: A Declarative Concurrent Object-oriented Programming Notation”, In Research Directions in Concurrent Object Oriented Programming, MIT Press.

    Google Scholar 

  28. Chu, D. and Clark, K.L. 1993. “IC-Prolog II: A Multi-threaded Prolog System”, In Proc. of the ICLP’93 Post Conf. Workshop on Concurrent, Distributed and Parallel Implementations of LP Systems, Budapest.

    Google Scholar 

  29. Ciancarini, P. 1991. “Parallel Logic Programming using the Linda Model of Computation”, In Research Directions in High-level Parallel Programming Languages, J.P. Banatre and D. Le Metayer (eds.), LNCS 574, June, pp. 110–125.

    Google Scholar 

  30. Ciancarini, P. 1994. “Distributed Programming with Logic Tuple Spaces”, New Generation Computing, Vol. 12, No. 3, May, pp. 251–284.

    Article  MATH  Google Scholar 

  31. Ciancarini, P., Knoche, A., Tolksdorf, R., Vitali, F. 1996b. “PageSpace: An Architecture to Coordinate Distributed Applications on the Web”, Computer Networks and ISDN Systems, Vol. 28, pp. 941–952.

    Article  Google Scholar 

  32. Ciancarini, P., Mazza, M., and Pazzaglia, L. 1998. “A Logic for a Coordination Model with Multiple Spaces”, Science of Computer Programming, Vol. 31, Nos. 2–3, pp. 231–262.

    Article  MATH  MathSciNet  Google Scholar 

  33. Ciancarini, P. and Rossi, D. 1998. “Coordinating Java Agents over the WWW”, World Wide Web Journal, Vol. 1, No. 2, pp. 87–99.

    Article  Google Scholar 

  34. Ciancarini, P., Omicini, A., and Zambonelli, F. 1999. “Coordination Technologies for Internet Agents”, Nordic Journal of Computing, Vol. 6, pp. 215–240.

    Google Scholar 

  35. Clark, K.L. and Gregory, S. 1986. “Parlog: Parallel Programming in Logic”, ACM Trans. Programming Languages and Systems, Vol. 8, No. 1, pp. 1–49.

    Article  MATH  Google Scholar 

  36. Clark, K.L. and McCabe, F.G. 2000. “Go!-A Logic Programming Language for the Internet”, DRAFT, July.

    Google Scholar 

  37. Clark, K.L. and Robinson, P.J. 2000. “Agents as Multi-threaded Logical Objects”, November. Available at http://www-lp.doc.ic.ac.uk/~klc/qp3.html.

  38. Clark, K.L., Robinson, P.J., and Hagen, R. 1998. “Programming Internet Based DAI Applications in Qu-Prolog”, In Multi-agent Systems, LNAI 1544, Springer-Verlag.

    Google Scholar 

  39. Coulouris, G., Dollimore, J., and Kindberg, T. 1994. Distributed Systems: Concepts and Design, Addison-Wesley, 2nd ed.

    Google Scholar 

  40. Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., and Slattery, S. 1998. “Learning to Extract Symbolic Knowledge from the World Wide Web”, In Proc. of the 15th Nat. Conf. on AI (AAAI-98).

    Google Scholar 

  41. Cremonini, M., Ominici, A., and Zambonelli, F. 1999. “Multi-agent Systems on the Internet: Extending the Scope of Coordination towards Security and Topology”, In Proc. of the 9th European Workshop on Modelling Autonomous Agents in a Multi-Agent World (MAMAAW’99), LNAI 1647, Springer-Verlag, pp. 77–88.

    Google Scholar 

  42. Cremonini, M., Ominici, A., and Zambonelli, F. 2000. “Ruling Agent Motion in Structured Environments”, In HPCN Europe 2000, LNCS, May.

    Google Scholar 

  43. Cunha, J.C. and Marques, R.F.P. 1996. “PVM-Prolog: A Prolog Interface to PVM”, In Proc. of the 1st Int. Austrian-Hungarian Workshop on Distributed and Parallel Systems, DAPSYS’96, Miskolc, Hungary.

    Google Scholar 

  44. Davison, A. 1993. “A Survey of Logic Programming-based Object Oriented Languages”, In Research Directions in Concurrent Object Oriented Programming, G. Agha, P. Wegner, A. Yonezawa (eds.), MIT Press.

    Google Scholar 

  45. Davison, A. 1999. “A Concurrent Logic Programming Model of the Web”, In PA-CLP’99: The 1st Int. Conf. on Constraint Technologies and Logic Programming, London, pp. 437–451.

    Google Scholar 

  46. De Bosschere, K. and Jacquet, J.-M. 1992. “Comparative Semantics of μlog”, In Proc. of the PARLE’92 Conf., D. Etiemble and J.-C. Syre (eds.), LNCS 605, Springer-Verlag, pp. 911–926.

    Google Scholar 

  47. De Bosschere, K. and Jacquet, J.-M. 1996a. “μ2log: Towards Remote Coordination”, In 1st Int. Conf. on Coordination Models, Languages and Applications (Coordination’96), P. Ciancarini and C. Hankin (eds.), Cesena, Italy, LNCS 1061, Springer-Verlag, April, pp. 142–159.

    Google Scholar 

  48. De Bosschere, K. and Jacquet, J.-M. 1996b. “Extending the μlog Framework with Local and Conditional Blackboard Operations”, Journal of Symbolic Computation.

    Google Scholar 

  49. De Bosschere, K. and Tarau, P. 1996. “Blackboard Extensions in Prolog”, Software-Practice and Experience, Vol. 26, No. 1, January, pp. 49–69.

    Article  Google Scholar 

  50. Decker, S., Brickley, D., Saarela, J., and Angele, J. 1998. “A Query and Inference Service for RDF”, In W3C Workshop on Query Languages for XML, Available at http://www.w3.org/TandS/QL/QL98/pp/queryservice.html

  51. Denti, E., Natali, A., and Omicini, A. 1998. “On the Expressive Power of a Language for Programming Coordination Media”, In Proc. of the 1998 ACM Symp. on Applied Computing (SAC’98), February, pp. 167–177.

    Google Scholar 

  52. Diaz, M., Rubio, B., and Troya, J.M. 1996. “Distributed Programming with a Logic Channel-based Coordination Model”, The Computer Journal, Vol. 39, No. 10, pp. 876–889.

    Article  Google Scholar 

  53. Diaz, M., Rubio, B., and Troya, J.M. 1997a. “DRL: A Distributed Real-time Logic Language”, Computer Languages, Vol. 23, Vol. 2–4, pp. 87–120.

    Article  MATH  Google Scholar 

  54. Elshiewy, N.A. 1990. Robust Coordinated Reactive Computing in Sandra, Thesis for Doctor of Technology, Royal Institute of Technology KTH and Swedish Institute of Computer Science (SICS), RIT (KTH) TRITA-TCS-9005, SICS/D-90-9003.

    Google Scholar 

  55. Etzioni, O. and Weld, D.S. 1995. “Intelligent Agents on the Internet: Fact, Fiction, and Forecast”, IEEE Expert, pp. 44–49, August.

    Google Scholar 

  56. Fernandez, M., Simeon, J., and Wadler, P. (eds.). 2000b. “XML Query Languages: Experiences and Exemplars”, Available at http://www-db.research.bell-labs.com/user/simeon/xquery.html

  57. Foster, I. 1992. “Information Hiding in Parallel Programs”, Tech. Report MCS-P290-0292, Argonne National Lab.

    Google Scholar 

  58. Foster, I. and Taylor, S. 1989. Strand: New Concepts in Parallel Programming, Prentice Hall.

    Google Scholar 

  59. Foster, I. and Taylor, S. 1992. “A Compiler Approach to Scalable Concurrent Program Design”, Tech. Report MCS-P306-0492, Argonne National Lab.

    Google Scholar 

  60. Franklin, S. and Graesser, A. 1996. “Is it an Agent, or just a Program?: A Taxonomy for Autonomous Agents”, In Proc. of the 3rd Int. Workshop on Agent Theories, Architectures and Languages, Springer Verlag. Available from http://www.msci.memphis.edu/~f ranklin/AgentProg.html

  61. Geist, G.A. Beguelin, A., Donjarra, J., Jiang, W., Manchek, R., and Sunderam, V. 1994. PVM: Parallel Virtual Machine A Users’ Guide and Tutorial for Networked Parallel Computing, MIT Press. Available at http://www.netlib.org/pvm3/book/pvm-book.html.

  62. Geist, G.A., Kohl, J.A., and Papadopoulos, P.M. 1996. “PVM and MPI: A Comparison of Features”, Calculateurs Paralleles, Vol. 8, No. 2.

    Google Scholar 

  63. Gelernter, D. 1989. “Multiple Tuple Spaces in Linda”, In Proc. PARLE’89: Parallel Architectures and Languages Europe, June, pp. 20–27.

    Google Scholar 

  64. Goh, C.H., Bressan, S., Madnick, S., and Siegel, M. 1999. “Context Interchange: New Features and Formalisms for the Intelligent Integration of Information”, ACM Trans. on Info. Systems, Vol. 17, No. 3, July, pp. 270–293.

    Article  Google Scholar 

  65. Haridi, S., Van Roy, P., Brand, P., Mehl, M., Scheidhauer, R., and Smolka, G. 1999. “Efficient Logic Variables for Distributed Computing”, ACM Trans. in Programming Languages and Systems, Vol. 21, No. 3, May, pp. 569–626.

    Article  Google Scholar 

  66. Haridi, S., Van Roy, P., Brand, P., and Schulte, C. 1998. “Programming Languages for Distributed Applications”, New Generation Computing, Vol. 16, No. 3, May, pp. 223–261.

    Google Scholar 

  67. Hewitt, C., 1985. “The Challenge of Open Systems”, Byte, April, pp. 223–233.

    Google Scholar 

  68. Hirsch, M., Silverman, W., and Shapiro, E.Y. 1987. “Computation Control and Protection in the Logix System”, In Concurrent Prolog: Collected Papers, Vol. 2, E.Y. Shapiro (ed.), MIT Press, Chapter 20, pp. 28–45. 69. Hong, T.W. and Clark, K.L. 2000. “Concurrent Programming on the Web with Webstream”, August. Avalable at: http://longitude.doc.ic.ac.uk/~twhl/longitude/.

  69. Hosoya, H. and Pierce, B.C. 2000. “XDuce: A Typed XML Processing Language”, Preliminary Report, Dept. of CIS, Univ. of Pennsylvania, March 8th.

    Google Scholar 

  70. Hull, R. 1997. “Managing Semantic Heterogeneity in Databases: A Theoretical Perspective”, Invited tutorial at 16th ACM Symp. on Principles of Databases Systems (PODS’97), Available at http://www-db.research.bell-labs.com/user/hull/pods97-tutorial.html.

  71. I3 Program. 1995. Reference Architecture for the Intelligent Integration of Information, Version 2.0 (draft), DARPA. Available at http://dc.isx.com/I3/html/briefs/I3brief.html.

  72. Jacquet, J.-M. and De Bosscher, K. 1994. “On the Semantics of μlog”, Future Generation Computer Systems, Vol. 10, pp. 93–135.

    Article  Google Scholar 

  73. Jeffery, D., Dowd, T., and Somogyi, Z. 1999. “MCORBA: A CORBA Binding for Mercury”, Tech. Report., Dept. of CSSE, Univ. of Melbourne, Australia.

    Google Scholar 

  74. Kahn, K.M., and Miller, M.S. 1988. “Language Design and Open Systems”, In The Ecology of Computation, B. Huberman (ed.), North Holland.

    Google Scholar 

  75. Klinger, S., Yardeni, E., Kahn, K., and Shapiro, E.Y. 1988. The Language FCP(:,?), In Proc. of the Int. Conf. on 5th Generation Computer Systems, pp. 763–773.

    Google Scholar 

  76. Kowalski, R. 1985. “Logic-based Open Systems”, Technical Report, Dept. of Computing, Imperial College, September.

    Google Scholar 

  77. Kowalski, K., and Sadri, F. 1996. “Towards a Unified Agent Architecture that Combines Rationality with Reactivity”, In Proc. of Int. Workshop on Logic in Databases, San Miniato, Italy, Springer-Verlag.

    Google Scholar 

  78. Kowalski, K., and Sadri, F. 1999. “From Logic Programming to Multi-Agent Systems”, Annals of Mathematics and Artificial Intelligence, Vol. 25, pp. 391–419.

    Article  MATH  MathSciNet  Google Scholar 

  79. Lakshmanan, L.V.S., Sadri, F., and Subramanian, I.N. 1996. “A Declarative Approach to Querying and Restructuring the World-Wide-Web”, In Post-ICDE Workshop on Research Issues in Data Engineering (RIDE’96), New Orleans, February. Available as ftp://ftp.cs.concordia.ca/pub/laks/papers/ride96.ps.gz.

  80. Levy, A.Y., Rajaraman, A., and Ordille, J.J. 1996. “Querying Heterogeneous Information Sources using Source Descriptions”, In Proc. of the Int. Conf. on Very Large Databases, September.

    Google Scholar 

  81. Liu, M. 1999. “Deductive Database Languages: Problems and Solutions”, ACM Computing Surveys, Vol. 31, No. 1, March, pp. 27–62.

    Article  Google Scholar 

  82. Loke, S.W. and Davison, A. 1998. “LogicWeb: Enhancing the Web with Logic Programming”, Journal of Logic Programming, 36, pp. 195–240.

    Article  MATH  Google Scholar 

  83. Loke, S.W. and Davison, A. 2001. “Secure Prolog Based Mobile Code”, Theory and Practice of Logic Programming, Vol. 1, No. 1, To Appear.

    Google Scholar 

  84. LPA 1997. LPA ProWeb Server. Available at http://www.lpa.co.uk/.

  85. Ludascher, B., Himmeroder, R., Lausen, G., May, W., and Schlepphorst, C. 1998. “Managing Semistructured Data with FLORID: A Deductive Object-Oriented Perspective”, Information Systems, Vol. 23, No. 8, pp. 1–25.

    Article  Google Scholar 

  86. Marchiori, M. and Saarela, J. 1998. “Query + Metadata + Logic = Met-alog”, In W3C Workshop on Query Languages for XML, Available at http://www.w3.org/TandS/QL/QL98/pp/metalog.html

  87. McCabe, F.G. and Clark, K.L. 1995. “April: Agent PRocess Interaction Language”, In Intelligent Agents: Theories, Architectures, and Languages, M. Wooldridge, N.R. Jennings (eds.), LNAI 890, Springer-Verlag, pp. 324–340.

    Google Scholar 

  88. Mehl, M., Schulte, C., and Smolka, G. 1998. “Futures and By-need Synchronization for Oz”, Tech. Report, Programming Systems Lab, DFKI and Univ. des Saarlandes, May.

    Google Scholar 

  89. Meijer, E. and Sheilds, M. 2000. “XMLambda: A Functional Language for Constructing and Manipulating XML Documents”, Tech Report, Oregon Graduate School.

    Google Scholar 

  90. Mendelzon, A.O. and Milo, T. 1997. “Formal Models of Web Queries”, In Proc. of the ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), May, pp. 134–143.

    Google Scholar 

  91. Menezes, R., Merrick, I., and Wood, I. 1999. “Coordination in a Content-Addressable Web”, Autonomous Agents and Multi-Agent Systems, Vol. 2, pp. 287–301.

    Article  Google Scholar 

  92. Meng, W. and Yu, C. 1995. Query Processing in Multidatabase Systems, Addison-Wesley.

    Google Scholar 

  93. Miller, M.S., Bobrow, D.G., Tribble, E.D., and Levy, J. 1987. “Logical Secrets”, In Logic Programming: Proc. 4th Int. Conf. (ICLP’87), pp. 704–728.

    Google Scholar 

  94. Moore, J.T. 1998. “Mobile Code Security Techniques”, CIS, Univ. of Pennsylvania, May.

    Google Scholar 

  95. Omicini, A. 1999. “On the Semantics of Tuple-based Coordination Models”, In Proc. of the 1999 ACM Symp. on Applied Computing (SAC’99), February, pp. 175–182.

    Google Scholar 

  96. Omicini, A., Denti, E., and Natali, A. 1995. “Agent Coordination and Control through Logic Theories”, AI*IA’95: In Proc. of the 4th AI*IA Congress, LNAI 992, Springer-Verlag, pp. 439–450.

    Google Scholar 

  97. Papadopoulos, G.A. and Arbab, F. 1998. “Coordination Models and Languages”, In Advances in Computers, Vol. 46, Academic Press, pp. 329–400.

    Google Scholar 

  98. Pappas, A. (coordinator) 1999. Workshop on Logic Programming and Distributed Knowledge Management, ALP-UK/ALP/Compulog-net Tutorial/Workshop at PA Expo99, London, April.

    Google Scholar 

  99. Papakonstantinou, Y., Abiteboul, S., and Garcia-Molina, H. 1996. “Object Fusion in Mediator Systems”, In Proc. of the Int. Conf. on Very Large Databases, September.

    Google Scholar 

  100. Pontelli, E. and Gupta, G. 1997. “W-ACE: A Logic Language for Intelligent Internet Programming”, ICTAI’97, In Proc. of the IEEE 9th Int. Conf. on Tools with AI, pp. 2–10. A much expanded version of this paper can be found at http://www.cs.nmsu.edu/lldap/pri_lp/web/.

  101. Pontelli, E. and Gupta, G. 1998. “WEB-KLIC: A Concurrent Logic-based Unified Framework for Internet Programming”, AITEC Contract Research Projects in FY 1998: Proposal, Tokyo, Japan, Available at http://icot10.icot.or.jp/AITEC/FGCS/funding/98/plan07.html.

  102. Ramakrishnan, R. and Silberschatz, A. 1998. “Scalable Integration of Data Collections on the Web”, Tech. Report, Univ. of Wiscosin-Madison.

    Google Scholar 

  103. Ramakrishnan, R. and Subrahmanian, V.S. (guest editors) 2000. Journal of Logic Programming Special Issue on Logic-based Heterogeneous Information Systems, Vol. 43, No. 1, April.

    Google Scholar 

    Google Scholar 

  104. Saraswat, V.J. 1993. Concurrent Constraint Programming, MIT Press.

    Google Scholar 

  105. Saraswat, V.M., Kahn, K., and Levy, J. 1990. “Janus: A Step towards Distributed Constraint Programming”, In North American Conf. on LP, MIT Press, October, pp. 431–446.

    Google Scholar 

  106. Scroeder, M., Marques, R., Wagner, G., and Cunha, J.C. 1997. “CAP-Concurrent Action and Planning: Using PVM-Prolog to Implement Vivid Agents”, In PAP’97: The 5th Int. Conf. on the Practical Applications of Prolog, London, pp. 271–289.

    Google Scholar 

  107. Shanmugasundaram, J., Tufte, K., He, G., Zhang, C., DeWitt, D., and Naughton, J. 1999. “Relational Databases for Querying XML Documents: Limitations and Opportunities”, In Proc. of the 25th VLDB Conf., Edinburgh, Scotland.

    Google Scholar 

  108. Shapiro, E.Y. 1989a. “The Family of Concurrent Logic Programming Languages”, ACM Computing Surveys, Vol. 21, No. 3, September, pp. 413–510.

    Article  Google Scholar 

  109. SICS. 1999 “SICStus Prolog Manual”, Swedish Institute of Computer Science, Kista, Sweden, Available at http://www.sics.se/sicstus/.

    Google Scholar 

  110. Slattery, C. and Craven, M. 1998. “Combining Statistical and Relational Methods for Learning in Hypertext Domains”, In Proc. of the 8th Int. Conf. on Inductive LP.

    Google Scholar 

  111. Sundstrom, A. 1998. Comparative Study between Oz 3 and Java, Master’s Thesis 1998-10-01, CS Dept., Uppsala University, Sweden.

    Google Scholar 

  112. Sun Microsystems, 1999. “The JavaSpaces Specification”, Available at http://java.sun.com/docs/books/jini/javaspaces.

  113. Sutcliffe, G. and Pinakis, J. 1992. “Prolog-D-Linda”, Technical Report 91/7, Dept. of CS, Univ. of Western Australia, Western Australia.

    Google Scholar 

  114. Szeredi, P., Molnár, K., and Scott, R. 1996. “Serving Multiple HTML Clients from a Prolog Application”, In Proc. of the 1st Workshop on Logic Programming Tools for Internet Applications, P. Tarau, A. Davison, K. De Bosschere, and M. Hermenegildo (eds.), JICSLP’96, September, pp. 81–90.

    Google Scholar 

  115. Taguchi, K., Sato, H., and Araki, K. 1998. “TeleLog: A Mobile Logic Programming Language”, Tech. Report, Chikushi Jyogakuen Univ. Japan.

    Google Scholar 

  116. Tarau, P. 1999. “Jinni: Intelligent Mobile Agent Programming at the Intersection of Java and Prolog”, Proc. of PAAM’99, London.

    Google Scholar 

  117. Tarau, P. and Dahl, V. 1998. “A Coordination Logic for Agent Programming in Virtual Worlds”, In Coordination Technology for Collaborative Applications-Organizations, Processes, and Agents, W. Conen and G. Neumann (eds.), Springer-Verlag.

    Google Scholar 

  118. Tarau, P. and Dahl, V. 1998. “Mobile Threads through First Order Continuations”, In Proc. of APPAI-GULP-PRODE’98, Coruna, Spain, July.

    Google Scholar 

  119. Tarau, P., De Bosschere, K, Dahl, V., and Rochefort, S. 1999. “LogiMOO: An Extensible Multi-User Virtual World with Natural Language Control”, Journal of Logic Programming, Vol. 38, No. 3, March, pp. 331–353.

    Article  MATH  Google Scholar 

  120. Taylor, S., Av-Ron, E., and Shapiro, E.Y. 1987. “A Layered Method for Process and Code Mapping”, New Generation Computing, Vol. 5, No. 2.

    Google Scholar 

  121. Tick, E. 1995. “The Deevolution of Concurrent Logic Programming Languages”, Journal of Logic Programming, 10th Anniversary Special Issue, Vol. 23, No. 2, p. 89–123.

    Article  MATH  MathSciNet  Google Scholar 

  122. Thorn, T. 1997. “Programming Languages for Mobile Code”, ACM Computing Surveys, Vol. 29, No. 3, pp. 213–239, September.

    Article  Google Scholar 

  123. Van Roy, P. 1999. “On the Separation of Concerns in Distributed Programming: Application to Distribution Structure and fault Tolerance in Mozart”, In Int. Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA’ 99), July.

    Google Scholar 

  124. Van Roy, P. and Haridi, S. 1999. “Mozart: A Programming System for Agent Applications”, In Int. Conf on Logic Programming (ICLP’99), Int. Workshop on Distributed and Internet Programming with Logic and Constraint Languages, November.

    Google Scholar 

  125. Van Roy, P., Haridi, S., Brand, P., Smolka, G., Mehl, M., and Scheidhauer, R. 1997. “Mobile Objects in Distributed Oz”, ACM Trans. on Programming Languages and Systems, Vol. 19, No. 5, September, pp. 804–851.

    Article  Google Scholar 

  126. Wadler, P. 2000. “XML: Some Hyperlinks Minus the Hype”, Bell Labs, Lucent Technologies, Available at http://cm.bell-labs.com/cm/cs/who/wadler/xml/.

  127. Waldo, J., Wyant, G., Wollrath, A., and Kendall, S. 1994. “A Note on Distributed Computing”, Tech Report SMLI TR-94-29, Sun Microsystems Lab, November.

    Google Scholar 

  128. Wetzel, G., Kowalski, R.A., and Toni, F. 1995. “A Theorem Proving Approach to CLP”, In Proc. of the 11th Workshop on LP.

    Google Scholar 

  129. W3C. 1998. Extensible Markup Language (XML), W3C Recommendation, 10th February, REC-xml-19980210 Available at http://www.w3.org/TR/REC-xml.

  130. W3C 2000b. Resource Description Framework (RDF), 5th May, Available at http://www.w3.org/RDF/.

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering, Prince of Songkla University, Hat Yai, Songkhla, 90112, Thailand

    Andrew Davison

Authors
  1. Andrew Davison
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Cyprus, 75 Kallipoleos St., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  2. Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queen’s Gate, London, SW7 2BZ, UK

    Fariba Sadri

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Davison, A. (2002). Logic Programming Languages for the Internet. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45628-7_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45628-7_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43959-2

  • Online ISBN: 978-3-540-45628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation