Logic programming with default, weak and strict negations

Authors:
Susumu Yamasaki
Affiliations:
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)
Venue:
Theory and Practice of Logic Programming
Year:
2006

Citing 17
Cited 0

Computational aspects of three-valued logic

Proc. of the 8th international conference on Automated deduction
Negation in logic programming

Journal of Logic Programming
Negation in logic programming

Foundations of deductive databases and logic programming
Signed data dependencies in logic programs

Journal of Logic Programming
A sound and complete semantics for a version of negation as failure

Theoretical Computer Science
Logic programs with classical negation

Logic programming
Well-founded semantics coincides with three-valued stable semantics

Fundamenta Informaticae
Logic programming with strong negation

Proceedings of the international workshop on Extensions of logic programming
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs

Theoretical Computer Science
A non-ground realization of the stable and well-founded semantics

Theoretical Computer Science
Autoepistemic logic of knowledge and beliefs

Artificial Intelligence
Combining closed world assumptions with stable negation

Fundamenta Informaticae - Special issue: to the memory of Prof. Cecylia Rauszer
A sound and complete procedure for a general logic program in non- floundering derivations with respect to the 3-valued stable model semantics

Theoretical Computer Science
Foundations of Logic Programming

Foundations of Logic Programming
Logic knowledge bases with two default rules

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.