Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings (Q1188837)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings |
scientific article |
Statements
Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings (English)
0 references
17 September 1992
0 references
The articles of this volume will be reviewed individually. The volume presents a collection of papers presented at a workshop on extensions of definite Horn clause programming. The main theme the papers of the volume concentrate on is the proof-theoretic approach, especially works inspired by Gentzen-style sequent calculus, natural-deduction, higher-order logic programming, and linear logic. In this respect, the volume presents a highly coherent collection, combining both theoretical and computational issues. The main emphasis is foundational and theoretical, although implementational issues are also partly dealt with in some of the papers. Indexed articles: \textit{Andreoli, Jean-Marc; Pareschi, Remo}, Logic programming with sequent systems: a linear logic approach, 1-30 [Zbl 1502.68056] \textit{Andrews, James H.}, Predicates as parameters in logic programming: a set-theoretic basis, 31-47 [Zbl 1502.68057] \textit{Aronsson, Martin; Eriksson, Lars-Henrik; Hallnäs, Lars; Kreuger, Per}, A survey of GCLA: a definitional approach to logic programming, 49-99 [Zbl 1502.68058] \textit{Beeson, Michael}, Some applications of Gentzen's proof theory in automated deduction, 101-156 [Zbl 07623944] \textit{Felty, Amy}, A logic program for transforming sequent proofs to natural deduction proofs, 157-178 [Zbl 1502.68063] \textit{Gabbay, D. M.}, Modal provability foundations for negation by failure, 179-222 [Zbl 1502.68064] \textit{Gunter, Elsa L.}, Extensions to logic programming motivated by the construction of a generic theorem prover, 223-244 [Zbl 1502.68066] \textit{Hudelmaier, Jörg}, A decision procedure for propositional N-Prolog, 245-251 [Zbl 1502.68067] \textit{Miller, Dale}, A logic programming language with lambda-abstraction, function variables, and simple unification, 253-281 [Zbl 1502.68070] \textit{Paulson, Lawrence C.; Smith, Andrew W.}, Logic programming, functional programming, and inductive definitions, 283-309 [Zbl 1502.68071] \textit{Pearce, David; Wagner, Gerd}, Logic programming with strong negation, 311-326 [Zbl 1502.68072] \textit{Schroeder-Heister, Peter}, Hypothetical reasoning and definitional reflection in logic programming, 327-339 [Zbl 1502.68073] \textit{van Hoof, Toine; Hoepelman, Jaap}, Non-monotonicity and conditionals in dialogue logic, 341-364 [Zbl 1502.68286]
0 references
Tübingen (FRG)
0 references
Logic programming
0 references
Proceedings
0 references
Workshop
0 references
abstract data types
0 references
Clark's completion
0 references
Curry-Howard isomorphism
0 references
concurrent logic programming
0 references
Harrop formulas
0 references
reasoning
0 references
SLDNF resolution
0 references
Horn clause programming
0 references
Gentzen-style sequent calculus
0 references
higher-order logic programming
0 references
unification
0 references
Linear Logic
0 references
\(\lambda\)Prolog
0 references
natural deduction
0 references
computational logics
0 references
negation as failure
0 references
Modularity
0 references