Logic Programming and Automated Reasoning: 5th International Conference, LPAR '94, Kiev, Ukraine, July 16 - 22, 1994. Proceedings / Edition 1

by Frank Pfenning

Overview

This volume presents the proceedings of the 5th International Conference on Logic Programming and Automated Reasoning, held aboard the ship "Marshal Koshevoi" on the Dnieper near Kiev, Ukraine in July 1994. The LPAR conferences are held annually in the former Soviet Union and aimed at bringing together researchers interested in LP and AR.

This proceedings contains the full versions of the 24 accepted papers evaluated by at least three referees ensuring a program of highest quality. The papers cover all relevant aspects of LP and AR ranging from theory to implementation and application.

Product Details

ISBN-13:	9783540582168
Publisher:	Springer Berlin Heidelberg
Publication date:	07/28/1994
Series:	Lecture Notes in Computer Science , #822
Edition description:	1994
Pages:	352
Product dimensions:	6.10(w) x 9.25(h) x 0.36(d)

Table of Contents

Generalization and reuse of tactic proofs.- Program tactics and logic tactics.- On the relation between the—?-calculus and the syntactic theory of sequential control.- On a proof-theoretical analysis of— 1 1 -AC,— 1 1 -DC and— 1 1 -CA.- Proof plans for the correction of false conjectures.- On the value of antiprenexing.- Implementing a finite-domain CLP-language on top of Prolog: a transformational approach.- RISC-CLP(CF) constraint logic programming over complex functions.- Logical closures.- Higher-order rigid E-unification.- Program extraction in a Logical Framework setting.- Higher-Order Abstract Syntax with induction in Coq.- Towards efficient calculi for resource-oriented deductive planning.- A logic programming framework for the abductive inference of intentions in cooperative dialogues.- Constraint logic programming in the sequent calculus.- On conditional rewrite systems with extra variables and deterministic logic programs.- A bottom-up reconstruction of the well-founded semantics for disjunctive logic programs.- An efficient computation of the extended generalized closed world assumption by support-for-negation sets.- Multi-SLD resolution.- On anti-links.- A generic declarative diagnoser for normal logic programs.- Goal dependent vs. goal independent analysis of logic programs.- A kind of achievement by parts method.- Projection in temporal logic programming.