Algebraic and Logic Programming: 4th International Conference, ALP '94 Madrid, Spain, September 14–16, 1994 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This volume constitutes the proceedings of the Fourth International Conference on Algebraic and Logic Programming (ALP '94), held in Madrid, Spain in September 1994.
Like the predecessor conferences in this series, ALP '94 succeeded in strengthening the cross-fertilization between algebraic techniques and logic programming. Besides abstracts of three invited talks, the volume contains 17 full revised papers selected from 41 submissions; the papers are organized into sections on theorem proving, narrowing, logic programming, term rewriting, and higher-order programming.

Author(s): Catuscia Palamidessi (auth.), Giorgio Levi, Mario Rodríguez-Artalejo (eds.)
Series: Lecture Notes in Computer Science 850
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1994

Language: English
Pages: 314
Tags: Programming Languages, Compilers, Interpreters; Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics)

Concurrent constraint programming....Pages 1-2
Specifications using multiple-conclusion logic programs....Pages 3-4
Viewing a program transformation system at work....Pages 5-5
Proving implications by algebraic approximation....Pages 6-22
Sufficient completeness and parameterized proofs by induction....Pages 23-40
Proving behavioural theorems with standard first-order logic....Pages 41-58
How to realize LSE narrowing....Pages 59-76
Compositional analysis for equational Horn programs....Pages 77-94
Equation solving in projective planes and planar ternary rings....Pages 95-113
From eventual to atomic and locally atomic CC programs: A concurrent semantics....Pages 114-132
Concurrent logic programming as uniform linear proofs....Pages 133-149
Three-valued completion for abductive logic programs....Pages 150-167
A sequential reduction strategy....Pages 168-185
On modularity of termination and confluence properties of conditional rewrite systems....Pages 186-203
Syntactical analysis of total termination....Pages 204-222
Logic programs as term rewriting systems....Pages 223-241
Higher-order minimal function graphs....Pages 242-252
Reasoning about layered, wildcard and product patterns....Pages 253-268
Preserving universal termination through unfold/fold....Pages 269-286
A logic for variable aliasing in logic programs....Pages 287-304