Modal Provability Foundations for Argumentation Networks

Dov M. Gabbay1
1King's College, London, UK

Tóm tắt

Từ khóa


Tài liệu tham khảo

Barringer, H., D. M. Gabbay, and J. Woods, ‘Temporal dynamics of argumentation networks’, in D. Hutter and W. Stephan (eds.), Mechanising Mathematical Reasoning, LNCS 2605, Springer, 2005, pp. 59–98.

Boolos, G., The Logic of Provability, Cambridge University Press, 1993.

Caminada, M., ‘A gentle introduction to argumentation semantics’, Lecture material, Summer 2008.

Carnelli, W., M. Corniglio, D. M. Gabbay, P. Gouveia, and C. Sernadas, Analysis and Synthesis of Logics, Springer, 2008, 604 pp.

Dung P.M.: ‘On acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games’. Artificial Intelligence 77, 321–357 (1995)

Dung M.P.: ‘An argumentation theoretic foundation for logic programming’. Joural of Logic Programming 22(2), 151–171 (1995)

Gabbay, D.M., Semantical Investigations in Modal and Tense Logics, Synthese, Volume 92, D. Reidel, 1976.

Gabbay, D.M., ‘Modal provability foundations for negation by failure’, Imperial College Technical Report, 86/4, 1986.

Gabbay, D.M., ‘Modal provability foundations for negation by failure’, in P. Schroeder-Heister (ed.), Extensions of Logic Programming, Vol. 475 of LNCS, Springer-Verlag, 1990, pp. 179–222.

Przymusinski, T., ‘Well founded semantics coincides with three valued stable semantics’, in W. Marek (ed.), Special issue on Non-monotonic reasoning, Fundamenta Informatica 13(4): 445–464, 1990.

Solovay R.: ‘Provability interpretations of modal logic’. Israel Journal of Mathematics 25, 287–304 (1976)