Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-13T06:55:35.734Z Has data issue: false hasContentIssue false

Special issue on ‘Logic Programming and the INTERNET’

Published online by Cambridge University Press:  15 June 2001

LEON STERLING
Affiliation:
Department of Computer Science and Software Engineering, University of Melbourne, Victoria 3010, Australia e-mail: leon@cs.mu.oz.au, lee@cs.mu.oz.au
LEE NAISH
Affiliation:
Department of Computer Science and Software Engineering, University of Melbourne, Victoria 3010, Australia e-mail: leon@cs.mu.oz.au, lee@cs.mu.oz.au
MANUEL HERMENEGILDO
Affiliation:
Facultad de Informatica, Universidad Politecnica de Madrid, Campus de Montegancedo, E-28660 Boadilla del Monte, Madrid, Spain e-mail: herme@fi.upm.es

Abstract

Computational logic systems can offer an attractive environment for developing Internet applications. They share many of the important characteristics of popular network programming tools, including dynamic memory management, well-behaved structure and pointer manipulation, robustness, and compilation to architecture-independent bytecode. However, in addition, computational logic systems offer some unique features such as very powerful symbolic processing capabilities, constraint solving, dynamic databases, search facilities, grammars, sophisticated meta-programming, and well understood semantics. Such features can often make it very easy to code simple applications.

This special issue concerned with applications is the third of its kind in a journal sponsored by the Association for Logic Programming. The first appeared in 1990, and showed the potential for logic programming to be extended. The second issue highlighted some papers from the Practical Applications of Prolog conference that had been held. This third time, the applications are concerned with the Internet and reflect the profound impact that the Internet has had on the computing landscape.

Type
Editorial
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)