Abstract
We introduce a proposal to give argumentation capacity to databases. A database is said to have argumentation capacity if it can extract from the information available to it a set of interacting arguments for and against claims and to determine the overall status of some information given all the interactions among all the arguments. We represent conflicts among arguments using a construct called a contestation, which permits us to represent various degrees of conflicts among statements. Argumentation databases as proposed here give exactly the same answers to queries as a database without argumentation capacity, but which are annotated with confidence values reflecting the degree of confidence one should have in the answer, where the degree of confidence is determined by the overall effect of all the interactions among the arguments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the 18th Symposium on Principles of Database Systems, pp. 68–79 (1999)
Bonderenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract argumentation theoretic approach to default reasoning. Artificial Intelligence 93, 63–101 (1997)
Dung, P.M.: The acceptability of arguments and its fundamental role in nonmontonic reasoning, logic programming, and n-person games. Artificial Intelligence 77, 321–357 (1995)
Gaasterland, T., Lobo, J.: Qualified answers that reflect user needs and preferences. In: Proceedings of the 20th VLDB Conference (1994)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Proc. 5th International Conference and Symposium on Logic Programming, Seattle, Washington, August 15-19, pp. 1070–1080 (1988)
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. Journal of Logic Programming 12, 335–368 (1992)
Kowalski, R., Toni, F.: Abstract argumentation. Artificial Intelligence and Law 4, 275–296 (1996)
Loui, R.P.: Defeat among arguments: a system of defeasible inference. Computational Intelligence 2, 100–106 (1987)
Lakshmanan, L., Sadri, F.: On A Theory of Probabilistic Deductive Databases. Theory and Practice of Logic Programming 1, 5–42 (2001)
Pollock, J.L.: Defeasible reasoning. Cognitive Science 11, 481–518 (1987)
Pradhan, S.: Semantics of Normal Logic Programs and Contested Information. In: Proc. 11th IEEE Symposium on Logic in Computer Science (1996)
Pradhan, S.: Logic Programs with Contested Information. In: Maher, M. (ed.) Proc. Joint International Conference and Symposium on Logic Programming, MIT Press, Cambridge (1996)
Pradhan, S.: Reasoning with conflicting information in artificial intelligence and database theory. Technical Report CS-TR-4211, Dept of Computer Science, University of Maryland, College Park, Md 20742, Ph.D. dissertation (2001)
Pradhan, S.: Connecting Databases with Argumentation. In: Bartenstein, O., Geske, U., Hannebauer, M., Yoshie, O. (eds.) INAP 2001. LNCS (LNAI), vol. 2543, pp. 170–185. Springer, Heidelberg (2003)
Praaken, H., Sartor, G.: A system for defeasible argumentation with defeasible priorities. In: Gabbay, D.M., Ohlbach, H.J. (eds.) FAPR 1996. LNCS, vol. 1085. Springer, Heidelberg (1996)
Praaken, H., Sartor, G.: Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-classical Logics 7, 25–75 (1997)
Subrahmanian, V.S.: Amalgamating knowledge bases. ACM Transactions on Database Systems 19, 291–331 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pradhan, S. (2003). Argumentation Databases. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24599-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20642-2
Online ISBN: 978-3-540-24599-5
eBook Packages: Springer Book Archive