A non-monotonic ATMS based on annotated logic programs with strong negation

  • Kazumi Nakamatsu
  • Atsuyuki Suzuki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1441)


In this paper, we translate Dressler's nonmonotonic ATMS with out-assumptions [Dr88] into an annotated logic program with strong negation (ALPSN) which was proposed in [NS94]. Nonmonotonic justifications and assumption nodes of Dressler's ATMS are translated into annotated logic program clauses with strong negation. The most important semantics for Dressler's ATMS is the extension. On the other hand, the corresponding ALPSN has the stable model semantics. We show that there is a one-to-one correspondence between the nonmonotonic ATMS extensions and the corresponding ALPSN stable models with respect to the translation. Dressler's ATMS includes two meta-rules of inference, the Consistent Belief Rule and the Nogood Inference Rule, and an axiom, the Negation Axiom. We also show that these inference rules and the axiom can be reduced into the ALPSN stable model computation. We take an example of the nonmonotonic ATMS based on ALPSNs (the ALPSN stable model computing system) and show how the ATMS works. Lastly, we indicate the advantages and the problems to be solved of the nonmonotonic ATMS based on ALPSNs, and mention future work.


annotated logic program extension nonmonotonic ATMS stable model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [As50]
    Asimov,I, I,Robot, Gnome Press, 1950.Google Scholar
  2. [BlS88]
    Blair,H.A. and Subrahmanian,V.S., “Paraconsistent Foundations for Logic Programming” J. Non-Classical Logic, VOl.5, 45–73, 1988.zbMATHMathSciNetGoogle Scholar
  3. [BlS89]
    Blair,H.A. and Subrahmanian,V.S., “Paraconsistent Logic Programming” Theoretical Computer Science, Vol.68, 135–154, 1989.zbMATHMathSciNetCrossRefGoogle Scholar
  4. [Dr88]
    Dressler,O., “An Extended Basic ATMS” Proc. 2nd Int'l Workshop on Nonmonotonic Reasoning, LNCS 346, 143–154, 1988.MathSciNetGoogle Scholar
  5. [dSV89]
    da Costa,N.C.A., Subrahmanian,V.S. and Vago,C, “The Paraconsistent Logic PT” Zeitschrift für Mathematische Logik und Grundlangen der Mathematik, Vol.37, 139–148, 1989.Google Scholar
  6. [GL89]
    Gelfond,M. and Lifschitz,V., “The Stable Model Semantics for Logic Programming” Proc. 5th Int'l Conf. and Symp. on Logic Programming, 1070–1080, 1989.Google Scholar
  7. [Ll87]
    Lloyd,J.W., Foundations of Logic Programming (2nd Edition), Springer, 1987.Google Scholar
  8. [NS94]
    Nakamatsu,K. and Suzuki,A., “Annotated Semantics for Default Reasoning” Proc. 3rd PRICAI, 180–186, 1994.Google Scholar
  9. [NS95]
    Nakamatsu,K. and Suzuki,A., “On the Relation Between Nonmonotonic ATMS and ALPSN”Proc. Japanese Society for AI SIG FAI 9502 1, 1–8,1995.Google Scholar
  10. [Re80]
    Reiter,R., “A Logic for Default Reasoning” Artificial Intelligence, Vol.13, 81–132,1980.zbMATHMathSciNetCrossRefGoogle Scholar
  11. [TK93]
    Thirunarayan,K. and Kifer,M., “A Theory of Nonmonotonic Inheritance Based on Annotated Logic” Artificial Intelligence, Vol.60, 23–50, 1993.zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kazumi Nakamatsu
    • 1
  • Atsuyuki Suzuki
    • 2
  1. 1.School of H.E.P.T.Himeji Institute of TechnologyHimejiJapan
  2. 2.Faculty of InformationShizuoka UniversityHamamatsuJapan

Personalised recommendations