Papers in Semantics

by Susumu Yamasaki

• Yamasaki,S., Equational dataflow programs computing logic programs, Trans. of IEICEJ, E71, pp.1134-1139, 1988.
• Yamasaki,S., Recursion equation sets computing logic programs, Theoretical Computer Science, 76, pp.309-322, 1990.
• Yamasaki,S., A network of communicating logic programs as an extension of Kahn's model, IEICE Trans., E74, pp.965-974, 1991.
• 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 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.
• Yamasaki,S., SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs, Theoretical Computer Science, 160, pp.283-303, 1996.
• Yamasaki,S., An abstraction of fixpoint semantics for normal logic programs, IEICE Trans. on Information and Systems, E79-D, 3, pp.196-208, 1996.
• Yamasaki,S., Sequence domains and fixpoint semantics for logic programs, IEICE Trans. on Information and Systems, E79-D, 6, pp.840-854, 1996.
• Yamasaki,S. and Ishiba,N., General stable model semantics and SLDNF resolution with non-safe rule for abduction, J. of Japanese Society for Artificial Intelligence, 12, 2, pp.245-257, 1997.
• Yamasaki,S. and Kurose,Y., Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, Theoretical Computer Science, 206, pp.257-281, 1998.
• Yamasaki,S. and Iriya,K., A combination of SLDNF resolution with narrowing for general logic programs with equations with respect to extended well-founded model, IEICE Trans. on Information and Systems, E82-D, 10, pp.1303-1315, 1999.
• Yamasaki,S. and Kurose,Y., A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, Theoretical Computer Science, 266, pp.489-512, 2001.
• Yamasaki,S., Semantics of normal goals as acquisitors caused by negation as failure, IEICE Trans. on Information and Systems, E86-D, 6, pp.993-1000, 2003.
• Yamasaki,S., Logic programming with default, weak and strict negations, Theory and Practice of Logic Programming, 6, pp.737-749, 2006.