## Extensions of Logic Programming: International Workshop, Tübingen, FRG, December 8-10, 1989. ProceedingsThis volume contains finalized versions of papers presented at an international workshop on extensions of logic programming, held at the Seminar for Natural Language Systems at the University of Tübingen in December 1989. Several recent extensions of definite Horn clause programming, especially those with a proof-theoretic background, have much in common. One common thread is a new emphasis on hypothetical reasoning, which is typically inspired by Gentzen-style sequent or natural deduction systems. This is not only of theoretical significance, but also bears upon computational issues. It was one purpose of the workshop to bring some of these recent developments together. The volume covers topics such as the languages Lambda-Prolog, N-Prolog, and GCLA, the relationship between logic programming and functional programming, and the relationship between extensions of logic programming and automated theorem proving. It contains the results of the first conference concentrating on proof-theoretic approaches to logic programming. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Linear Logic Approach | 1 |

A SetTheoretic Basis | 31 |

A Definitional Approach to Logic Programming | 49 |

Some Applications of Gentzens Proof Theory in Automated Deduction | 101 |

A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs | 157 |

MODAL PROVABILITY FOUNDATIONS for NEGATION BY FAILURE | 179 |

Extensions to Logic Programming Motivated by the Construction of a Generic Theorem Prover | 223 |

A Decision Procedure for Propositional NProlog | 245 |

A Logic Programming Language with LambdaAbstraction Function Variables and Simple Unification | 253 |

Logic Programming Functional Programming and Inductive Definitions | 283 |

Logic Programming with Strong Negation | 311 |

Hypothetical Reasoning and Definitional Reflection in Logic Programming | 327 |

NonMonotonicity and Conditionals in Dialogue Logic | 341 |

### Other editions - View all

Extensions of Logic Programming: International Workshop, Tübingen, FRG ... Peter Schroeder-Heister No preview available - 2014 |

### Common terms and phrases

A-terms abstraction antecedent application assume atomic formula axiom backchaining calculus Classical Logic Computer Science condition conjunction consider constant construct contains context corresponding counterfactual Cut rule database defined definite clauses denote deterministic dialogue E-deduction example existentially quantified Extended Prolog finite first-order logic fixed point free variables functional programming Gabbay Gamma GCLA GENTZEN given goal hence higher-order Horn clause implementation implication inductive definitions inference rules instantiated interpreter intuitionistic logic Lemma logic programming language loop meta-interpreter modal logic module multiset natural deduction negation by failure node non-deterministic normal notion numb_quant occur operational operational semantics permutation predicate premise procedure Prolog Prolog sequent Prolog variables propositional prove proviso quantified variables query restriction result schema semantics sequent calculus solution specification strong negation structure succeeds syntactic syntax theorem prover theory unification algorithm unification problem unify universally quantified