Semantics for Logic Programs

• Yamasaki,S. et al., A fixpoint semantics of Horn sentences based on substitution sets, Theoretical Computer Science, 51, pp.309-324, 1987.
• 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., Extraction of functional from logic program, Proc. of PLILP '91, Passau, Lecture Notes in Computer Science, 528, pp.27-38, 1991.
• Yamasaki,S., A network of communicating logic programs as an extension of Kahn's model, IEICE Trans., E74, pp.965-974, 1991.
• Yamasaki,S. and Iida,K., Transformation of logic programs to FP programs based on dataflows, J. of Symbolic Computation, 18, pp.157-182, 1994.
• Yamasaki,S., Sequence domains and fixpoint semantics for logic programs, IEICE Trans. on Information and Systems, E79-D, 6, pp.840-854, 1996.