Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
Asimov,I, I,Robot, Gnome Press, 1950.
Blair,H.A. and Subrahmanian,V.S., “Paraconsistent Foundations for Logic Programming” J. Non-Classical Logic, VOl.5, 45–73, 1988.
Blair,H.A. and Subrahmanian,V.S., “Paraconsistent Logic Programming” Theoretical Computer Science, Vol.68, 135–154, 1989.
Dressler,O., “An Extended Basic ATMS” Proc. 2nd Int'l Workshop on Nonmonotonic Reasoning, LNCS 346, 143–154, 1988.
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.
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.
Lloyd,J.W., Foundations of Logic Programming (2nd Edition), Springer, 1987.
Nakamatsu,K. and Suzuki,A., “Annotated Semantics for Default Reasoning” Proc. 3rd PRICAI, 180–186, 1994.
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.
Reiter,R., “A Logic for Default Reasoning” Artificial Intelligence, Vol.13, 81–132,1980.
Thirunarayan,K. and Kifer,M., “A Theory of Nonmonotonic Inheritance Based on Annotated Logic” Artificial Intelligence, Vol.60, 23–50, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamatsu, K., Suzuki, A. (1998). A non-monotonic ATMS based on annotated logic programs with strong negation. In: Wobcke, W., Pagnucco, M., Zhang, C. (eds) Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications. DAI 1997. Lecture Notes in Computer Science, vol 1441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055021
Download citation
DOI: https://doi.org/10.1007/BFb0055021
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64769-0
Online ISBN: 978-3-540-68722-1
eBook Packages: Springer Book Archive