start-ver=1.4
cd-journal=joma
no-vol=6
cd-vols=
no-issue=6
article-no=
start-page=737
end-page=749
dt-received=
dt-revised=
dt-accepted=
dt-pub-year=2005
dt-pub=20051108
dt-online=
en-article=
kn-article=
en-subject=
kn-subject=
en-title=
kn-title=Logic programming with default weak and strict negations
en-subtitle=
kn-subtitle=
en-abstract=
kn-abstract=<p>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.</p>

en-copyright=
kn-copyright=

en-aut-name=YamasakiSusumu
en-aut-sei=Yamasaki
en-aut-mei=Susumu
kn-aut-name=
kn-aut-sei=
kn-aut-mei=
aut-affil-num=1
ORCID=

affil-num=1
en-affil=
kn-affil=Okayama University
en-keyword=negation in logic programming
kn-keyword=negation in logic programming
en-keyword=3-valued logic
kn-keyword=3-valued logic
END