Logic Programming with Default, Weak and Strict Negations

2005/11/10 by Susumu Yamasaki, Yamasaki, Susumu
Computer Science · #Advanced Algebra and Logic #F.3.2 #F.4.1 #FOS: Computer and information sciences #I.2.3 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.cs/0511041

openalex publication_date 2005/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper treats 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.

Related

• A note on the Declarative reading(s) of Logic Programming
• Towards a unified theory of logic programming semantics: Level mapping characterizations of selector generated models
• Overcoming Misleads In Logic Programs by Redefining Negation
• Tight Logic Programs
• An Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning