Procedures in Nonmonotonic Reasoning

• 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. 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.