Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-16T07:29:13.862Z 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: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)