Algebraic and Logic Programming Second International Conference, Nancy, France, October 1-3, 1990. Proceedings / edited by Helene Kirchner, Wolfgang Wechler.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Kirchner, Helene (Editor), Wechler, Wolfgang (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1990.
Edition:	1st ed. 1990.
Series:	Lecture Notes in Computer Science, 463 Springer eBook Collection.
Subjects:	Software engineering. Artificial intelligence. Mathematical logic. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

Proving and rewriting
Proving correctness w.r.t. specifications with hidden parts
Hybrid implementations of algebraic specifications
Multi-modal logic programming using equational and order-sorted logic
Logic programs with equational type specifications
Higher-order order-sorted algebras
Axiomatization of a functional logic language
Fourier algorithm revisited
Fixpoint techniques for non-monotone maps
Domain theory for nonmonotonic functions
On the strong completion of logic programs
An equivalence preserving first order unfold/fold transformation system
Propositional calculus problems in CHIP
Unfolding and fixpoint semantics of concurrent constraint logic programs
Eliminating negation from normal logic programs
On logic programming interpretations of Dislog: Programming long-distance dependencies in logic
Recursive query processing in predicate-goal graph
Implementation of completion by transition rules + control: ORME
A matching process modulo a theory of categorical products
Equation solving in conditional AC-theories
Lazy narrowing in a graph machine
An abstract concurrent machine for rewriting
Applying term rewriting methods to finite groups
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Optimization of rewriting and complexity of rewriting
AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.

Similar Items