Hostname: page-component-7b9c58cd5d-v2ckm Total loading time: 0 Render date: 2025-03-15T04:40:11.561Z Has data issue: false hasContentIssue false
  • English
  • Français

Logic programming with default, weak and strict negations

Published online by Cambridge University Press:  16 October 2006

SUSUMU YAMASAKI
SUSUMU YAMASAKI
Affiliation:
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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

negation in logic programming3-valued logic
Type
Technical Note
Information
Theory and Practice of Logic Programming , Volume 6 , Issue 6 , November 2006 , pp. 737 - 749
Copyright
2006 Cambridge University Press