Equational Dataflow Programs Computing Logic Programs
Summary :
In this paper we give a method of transforming logic programs into equational dataflow programs. The equational dataflow program is a set of recursion equations as to variables over a sequence domain. A recursion equation corresponds to each definite (Horn) clause which is interpreted as a transformation of variables to a variable. Each variable denotes a function from the set of natural numbers to the Herbrand base, that is, a sequence of ground atoms. The fair merge function is necessary to realize OR-nondeterminism, which is essential in the deductions of logic programs, by means of an equational dataflow program. The nondeterminism in the transformation caused by a definite clause is eliminated and ensured fair by introducing a kind of oracle which will also be provided by simple recursion equations. Then it will be shown that the equational dataflow program with the oracle is both sound and complete in denoting the finite computation of the original logic program. The semantics of the equational dataflow program is given by fixpoint approach and is interpreted as a semantics of the given logic program.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E71-E No.11 pp.1134-1139
- Publication Date
- 1988/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Automaton, Language and Theory of Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Susumu YAMASAKI, "Equational Dataflow Programs Computing Logic Programs" in IEICE TRANSACTIONS on transactions,
vol. E71-E, no. 11, pp. 1134-1139, November 1988, doi: .
Abstract: In this paper we give a method of transforming logic programs into equational dataflow programs. The equational dataflow program is a set of recursion equations as to variables over a sequence domain. A recursion equation corresponds to each definite (Horn) clause which is interpreted as a transformation of variables to a variable. Each variable denotes a function from the set of natural numbers to the Herbrand base, that is, a sequence of ground atoms. The fair merge function is necessary to realize OR-nondeterminism, which is essential in the deductions of logic programs, by means of an equational dataflow program. The nondeterminism in the transformation caused by a definite clause is eliminated and ensured fair by introducing a kind of oracle which will also be provided by simple recursion equations. Then it will be shown that the equational dataflow program with the oracle is both sound and complete in denoting the finite computation of the original logic program. The semantics of the equational dataflow program is given by fixpoint approach and is interpreted as a semantics of the given logic program.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e71-e_11_1134/_p
Copy
@ARTICLE{e71-e_11_1134,
author={Susumu YAMASAKI, },
journal={IEICE TRANSACTIONS on transactions},
title={Equational Dataflow Programs Computing Logic Programs},
year={1988},
volume={E71-E},
number={11},
pages={1134-1139},
abstract={In this paper we give a method of transforming logic programs into equational dataflow programs. The equational dataflow program is a set of recursion equations as to variables over a sequence domain. A recursion equation corresponds to each definite (Horn) clause which is interpreted as a transformation of variables to a variable. Each variable denotes a function from the set of natural numbers to the Herbrand base, that is, a sequence of ground atoms. The fair merge function is necessary to realize OR-nondeterminism, which is essential in the deductions of logic programs, by means of an equational dataflow program. The nondeterminism in the transformation caused by a definite clause is eliminated and ensured fair by introducing a kind of oracle which will also be provided by simple recursion equations. Then it will be shown that the equational dataflow program with the oracle is both sound and complete in denoting the finite computation of the original logic program. The semantics of the equational dataflow program is given by fixpoint approach and is interpreted as a semantics of the given logic program.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Equational Dataflow Programs Computing Logic Programs
T2 - IEICE TRANSACTIONS on transactions
SP - 1134
EP - 1139
AU - Susumu YAMASAKI
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 11
JA - IEICE TRANSACTIONS on transactions
Y1 - November 1988
AB - In this paper we give a method of transforming logic programs into equational dataflow programs. The equational dataflow program is a set of recursion equations as to variables over a sequence domain. A recursion equation corresponds to each definite (Horn) clause which is interpreted as a transformation of variables to a variable. Each variable denotes a function from the set of natural numbers to the Herbrand base, that is, a sequence of ground atoms. The fair merge function is necessary to realize OR-nondeterminism, which is essential in the deductions of logic programs, by means of an equational dataflow program. The nondeterminism in the transformation caused by a definite clause is eliminated and ensured fair by introducing a kind of oracle which will also be provided by simple recursion equations. Then it will be shown that the equational dataflow program with the oracle is both sound and complete in denoting the finite computation of the original logic program. The semantics of the equational dataflow program is given by fixpoint approach and is interpreted as a semantics of the given logic program.
ER -
English
