On the relation between vector annotated logic programs and defeasible theories
DOI:
https://doi.org/10.12775/LLP.2000.010Keywords
annotated logic program, defeasible logic, logic programming, nonmonotonic reasoningAbstract
In this paper, we propose an annotated logic program called a VALPSN (Vector Annotated Logic Program with Strong Negation) to deal with defeasible reasoning. We propose a translation from Billington’s defeasible theory into VALPSN and clarify the relation between them based on the translation.References
Billington,D., “Defeasible logic is stable”, J. Logic and Computation 3, 379–400, 1993.
Billington, D., “Conflicting literals and defeasible logic”, Proc. 2nd Australian Workshop on Commonsense Reasoning, pp. 1–14, 1997.
Blair, H.A., and V.S. Subrahmanian, “Paraconsistent logic programming”, Theoretical Computer Science 68, 135–154, 1989.
da Costa, N.C.A., V.S. Subrahmanian, and C. Vago, “The paraconsistent logics PT ”, Zeitschrift für Mathematische Logik und Grundlangen der Mathematik 37, 139–148, 1989.
Gelfond, M., and V. Lifschitz, “The stable model semantics for logic programming”, Proc. 5th Int’l Conf. and Symposium on Logic Programming, pp. 1070–1080, 1988.
Lloyd, J.W., Foundations of Logic Programming, 2nd edition, Springer-Verlag, 1987.
Nakamatsu, K., and A. Suzuki, “Annotated semantics for default reasoning”, Proc. 3rd Pacific Rim Int’l Conf. on AI, pp. 180–186, 1994.
Nakamatsu, K. and A. Suzuki, “A nonmonotonic ATMS based on annotated logic programs”, Agents and Multi-Agents, LNAI 1441, pp. 79–93, Springer-Verlag, 1998.
Nute, D., “Defeasible reasoning”, Proc. Hawaii Int’l Conf. on System Science, pp. 470–477, 1987.
Nute, D., “Basic defeasible logic”, Intensional Logics for Programming, pp. 125–154, Oxford Univ. Press, 1992.
Subrahmanian, V.S., “On the semantics of qualitative logic programs”, Proc. 4th IEEE Symposium on Logic Programming, pp. 178–182, 1987.
Downloads
Published
How to Cite
Issue
Section
Stats
Number of views and downloads: 537
Number of citations: 0
