Dataflow and Logic Languages

• Yamasaki,S. et al., A fixpoint semantics of Horn sentences based on substitution sets, Theoretical Computer Science, 51, pp.309-324, 1987.
• Yamasaki,S., A network of communicating logic programs and its semantics, Proc. of 10th IJCAI-87, Milan, 1, pp,24-29, 1987.
• Yamasaki,S., Semantics of logic programs over sequence domains, Proc. of FGCS'88, Tokyo, 2, pp.382-388, 1988.
• Yamasaki,S., Equational dataflow programs computing logic programs, Trans. of IEICEJ, E71, pp.1134-1139, 1988.
• Yamasaki,S., Dataflow programs for parallel computations of logic programs and their semantics, Proc. of Parle '89, Eindhoven, Lecture Notes in Computer Science, 366, pp.104-114, 1989.
• Yamasaki,S., Recursion equation sets computing logic programs, Theoretical Computer Science, 76, pp.309-322, 1990.
• Yamasaki,S., Dataflow for logic program as substitution manipulator, Proc. of Int Symp. on Symbolic and Algebraic Computation, Tokyo, pp.45-51, 1990.
• Yamasaki,S., Dataflow computing mechanism for logic program and extraction of functional from it, Software Science and Engineering (Nakata,I. and Hagiya,M., eds.), World Scientific, pp.78-97, 1991.
• Yamasaki,S., A network of communicating logic programs as an extension of Kahn's model, IEICE Trans. on Information and Systems, E74, pp.965-974, 1991.
• Yamasaki,S., Extraction of functional from logic program, Proc. of PLILP '91, Passau, Lecture Notes in Computer Science, 528, pp.27-38, 1991.
• Yamasaki,S., A denotational semantics and dataflow construction for logic programs, Theoretical Computer Science, 124, pp.71-91, 1994.
• Yamasaki,S. and Iida,K., Transformation of logic programs to FP programs based on dataflows, J. of Symbolic Computation, 18, pp.157-182, 1994.