In this paper we present an embedding of abstract argumentation systems into the framework of Barwise and Seligman’s logic of information flow. We show that, taking P.M. Dung’s characterization of argument systems, a local logic over states of a deliberation may be constructed. In this structure, the key feature of non-monotonicity of commonsense reasoning obtains as the transition from one local logic to another, due to a change in certain background conditions. Each of Dung’s extensions of argument systems leads to a corresponding ordering of background conditions. The relations among extensions becomes a relation among partial orderings of background conditions. This introduces a conceptual innovation in Barwise and Seligman’s representation of commonsense reasoning.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Barwise, J., 1999, “State spaces, local logics and non-monotonicity,” in Logic, Language and Computation, Vol. 2, L. Moss, J. Ginzburg, and M. de Rijke, eds., Stanford: CSLI Publications.
Barwise, J. and Seligman, J., 1997, Information Flow: The Logic of Distributed Systems, Cambridge, MA: Cambridge University Press.
Dung, P.M., 1995, “On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming, and n-person games,” Artificial Intelligence 77, 321–357.
McCarthy, J., 1980, “Circumscription–A form of non-monotonic reasoning,” Artificial Intelligence 13, 27–39.
McCarthy, J. and Hayes, P., 1969, “Some philosophical problems from the standpoint of artificial intelligence,” in Machine Intelligence 4, B. Meltzer and D. Mitchie, eds., Edimburg University Press.
McDermmot, J. and Doyle, J., 1980, “Non-monotonic Logic I,” Artificial Intelligence 13, 41–72.
Lin, F. and Shoham, Y., 1989, “Argument systems: a uniform basis for nonmonotonic reasoning,” pp. 245–255 in Proceedings of the 1st International Conference on Knowledge Representation and Reasoning, San Mateo, CA: Morgan Kaufmann Publishers.
Loui, R., 1987, “Defeat among arguments: a system of defeasible inference,” Computational Intelligence 3, 100–106.
Loui, R., 1998, “Process and policy: resource-bounded non-demonstrative reasoning,” Computational Intelligence 14, 1–38.
Pollock, J., 1987, “Defeasible reasoning,” Cognitive Science 11, 481–518.
Poole, D., 1988, “A logical framework for default reasoning,” Artificial Intelligence 36, 27–47.
Reiter, R., 1980, “A logic for default reasoning,” Artificial Intelligence 13, 81–132.
Simari, G. and R. Loui, 1992 “A mathematical treatment of defeasible reasoning and its implementation,” Artificial Intelligence 53, 125–157.
About this article
Cite this article
Bodanza, G.A., Tohmé, F.A. Local logics, non-monotonicity and defeasible argumentation. J Logic Lang Inf 14, 1–12 (2004). https://doi.org/10.1007/s10849-004-4510-7
- Defeasible argumentation
- local logics