The 1993 International Logic Programming Symposium was held in Vancouver, British Columbia, on 26-29 October. It presented the state of the art in logic programming, emphasizing the deliberate interaction with other fields, in particular, humanistic fields. Topics covered at the symposium included algorithmic analysis, programming methodologies, semantic analysis, deductive databases, and programming language design.

Welcome to On-line Guide to Prolog Programming designed and maintained by Roman Barták. I opened this site as a contribution to evolving area of logic programming languages and PROLOG in particular. I intend it to be an introduction to logic programming and PROLOG for beginners but I also expect to cover some advanced topics. It's not meant as an unclassified collection of links to other pages although I also include some interesting links here.

Kaufmann, Benjamin (University of Potsdam) | Leone, Nicola (University of Calabria) | Perri, Simona (University of Calabria) | Schaub, Torsten (University of Potsdam)

Answer set programming is a declarative problem solving paradigm that rests upon a workflow involving modeling, grounding, and solving. While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground terms in a effective way, and solving, or how to compute the answer sets of a propositional logic program obtained by grounding.

Charalambidis, Angelos (University of Athens) | Rondogiannis, Panos (University of Athens)

Extensional higher-order logic programming has been recently proposed as an interesting extension of classical logic programming. An important characteristic of the new paradigm is that it preserves all the well-known properties oftraditional logic programming. In this paper we enhance extensional higher-order logic programming with constructive negation. We argue that the main ideas underlying constructive negation are quite close to the existing proof procedurefor extensional higher-order logic programming and for this reason the two notions amalgamate quite conveniently. We demonstrate the soundness of the resulting proof procedure and describe an actual implementation of a language that embodies the above ideas. In this way we obtain the first (to our knowledge) higher-order logic programming language supporting constructive negation and offering a new style of programming that genuinely extends that of traditional logic programming.