SLDNF Resolution with Non-Safe Rule, Abductive Proof Procedure and Semantics for General Logic Programs

• Adach,W. and Yamasaki,S., Negation as inconsistency and double negation problem, J. of Japan Society for Artificial Intelligence, 10, 6, pp. 953-961, 1995 (in Japanese).
• Yamasaki,S., Control problem of a class of pushdown automata based on posets and its application to resolution deduction, IEICE Trans. on Information and Systems, E78-D, 11, pp.1488-1497, 1995.
• 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, pp.196-208, 1996.
• Yamasaki,S., Sequence domains and fixpoint semantics for logic programs, IEICE Trans. on Information and Systems, E79-Dpp.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.
• Kurose,Y. and Yamasaki,S., Abduction in 3-valued logic, J. of Japanese Society for Artificial Intelligence, 13, 5, pp.757-767 1998 (in Japanese).
• Kurose,Y. and Yamasaki,S., Integrity onstraint and semantics of 3-valued abduction frameworks, J. of Japanese Society for Artificial Intelligence, 14, 3, pp.520-528, 1999 (in Japanese).
• 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., Abductive proof procedure with adjusting derivations for general logic programs, Memoirs of the Fac. of Eng., Okayama Univ., 35, 1-2, pp. 97-135, 2001.