Extensions of Logic Programming

This volume contains papers presented at an international workshop. It gives an overview of various approaches to extending logic programming, concentrating on proof-theoretic extensions developed recently, which put a new emphasis on hypothetical reasoning.

Inhalt
Logic programming with sequent systems.- Predicates as parameters in logic programming.- A survey of GCLA: A definitional approach to logic programming.- Some applications of Gentzen's proof theory in automated deduction.- A logic program for transforming sequent proofs to natural deduction proofs.- Modal provability foundations for negation by failure.- Extensions to logic programming motivated by the construction of a generic theorem prover.- A decision procedure for propositional N-Prolog.- A logic programming language with lambda-abstraction, function variables, and simple unification.- Logic programming, functional programming, and inductive definitions.- Logic programming with strong negation.- Hypothetical reasoning and definitional reflection in logic programming.- Non-monotonicity and conditionals in dialogue logic.