CJO - Abstract - Logic programming with default, weak and strict negations

Theory and Practice of Logic Programming (2006), 6: 737-749 Cambridge University Press

Copyright © 2006 Cambridge University Press

doi:10.1017/S1471068406002791

Published online by Cambridge University Press 16 Oct 2006

Technical Note

Logic programming with default, weak and strict negations

SUSUMU YAMASAKI ^a1
^a1 Department of Computer Science, Graduate School of Natural Science and Technology, Okayama University, Okayama 700-8530, Japan (email: yamasaki@momo.it.okayama-u.ac.jp)

Article author query

yamasaki s [Google Scholar]

Abstract

This paper looks at logic programming with three kinds of negation: default, weak and strict negations. A 3-valued logic model theory is discussed for logic programs with three kinds of negation. The procedure is constructed for negations so that a soundness of the procedure is guaranteed in terms of 3-valued logic model theory.

(Received October 19 2004)
(Revised March 30 2005)
(Revised July 8 2005)
(Accepted November 8 2005)

Key Words: negation in logic programming; 3-valued logic.