Dataflow for logic program as substitution manipulator

Authors:
S. Yamasaki
Affiliations:
Department of Information Technology, Okayama University, Tsushimanaka, Okayama, Japan
Venue:
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1990

Citing 5
Cited 0

Properties of substitutions and unifications

Journal of Symbolic Computation
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
On the Interpretation of Infinite Computations in Logic Programming

Proceedings of the 11th Colloquium on Automata, Languages and Programming
An Extensional Treatment of Dataflow Deadlock

Proceedings of the International Sympoisum on Semantics of Concurrent Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows a method of constructing a dataflow, which denotes the deductions of a logic program, by means of a sequence domain based on equivalence classes of substitutions. The dataflow involves fair merge functions to represent unions of atom subsets over a sequence domain, as well as functions as manipulations of unifiers for the deductions of clauses. A continuous functional is associated with the dataflow on condition that the dataflow completely and soundly denotes the atom generation in terms of equivalent substitutions sets. Its least fixpoint is interpreted as denoting the whole atom generation based on manipulations of equivalent substitutions sets.