Annotated Semantics for Nonmonotonic Reasonings in Artificial Intelligence I

Authors:
Kazumi Nakamatsu;Atsuyuki Suzuki
Affiliations:
University of Hyogo, HIMEJI 670-0092 JAPAN, nakamatu@shse.u-hyogo.ac.jp;Shizuoka University, HAMAMATSU 432-8011 JAPAN, suzuki@cs.inf.shizuoka.ac.jp
Venue:
Proceedings of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005
Year:
2005

Citing 4
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
An extended Basic ATMS

Proceedings of the 2nd international workshop on Non-monotonic reasoning
Paraconsistent logic programming

Theoretical Computer Science
Stable and extension class theory for logic programs and default logics

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce an annotated logic program with strong negation abbreviated as ALPSN(Annotated Logic Program with Strong Negation) and its stable model semantics and stable class semantics. Then we provide four declarative annotated semantics for nonmonotonic reasonings : default theory, nonmonotonic ATMS, the Negation as Failure rule, the Closed World Assumption based on ALPSN in the subsequent papers.