Abstract
Most formal approaches to argumentative reasoning under uncertainty focus on the analysis of qualitative aspects.An exception is the framework of probabilistic argumentation systems.Its philosophy is to include both qualitative and quantitative aspects through a simple way of combining logic and probability theory. Probabilities are used to weigh arguments for and against particular hypotheses.ABEL is a language that allows to describe probabilistic argumentation systems and corresponding queries about hypotheses.It then returns arguments and counter-arguments with corresponding numerical weights.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
B. Anrig, R. Bissig, R. Haenni, J. Kohlas, and N. Lehmann. Probabilistic argumentation systems: Introduction to assumption-based modeling with ABEL. Technical Report 99-1, Institute of Informatics, University of Pribourg, 1999.
B. Anrig, R. Haenni, J. Kohlas, and N. Lehmann. Assumption-based modeling using ABEL. In D. Gabbay, R. Kruse, A. Nonnengart, and H. J. Ohlbach, editors, First Internat. Joint Conf. on Qualitative and Quantitative Practical Reasoning; ECSQARU-FAPR’97. Lecture Notes in Artif. Intell., Springer, 1997.
B. Anrig, R. Haenni, and N. Lehmann. ABEL-a new language for assumption-based evidential reasoning under uncertainty. Technical Report 97-01, University of Pribourg, Institute of Informatics, 1997.
D. Berzati, R. Haenni, and J. Kohlas. Probabilistic argumentation systems and abduction. In C. Baral and M. Truszczynski, editors, Proc. of the 8th Internat. Workshop on Non-Monotonic Reasoning, Breckenridge Colorado, 2000.
J. de Kleer. An assumption-based TMS. Artificial Intelligence, 28:127–162, 1986.
R. Haenni. Cost-bounded argumentation. International Journal of Approximate Reasoning, 26(2):101–127, 2001.
R. Haenni. A query-driven anytime algorithm for argumentative and abductive reasoning. In D. Bustard, W. Liu, and R. Sterrit, editors, Soft-Ware 2002, 1st International Conference on Computing in an Imperfect World, Belfast, pages 114–127. Lecture Notes in Computer Science2311, Springer, 2002.
R. Haenni, J. Kohlas, and N. Lehmann. Probabilistic argumentation systems. In J. Kohlas and S. Moral, editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 5: Algorithms for Uncertainty and Defeasible Reasoning. Kluwer, Dordrecht, 2000.
D. Poole. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64:81–129, 1993.
N. Lehmann R. Haenni. Probabilistic argumentation systems: a new perspective on dempster-shafer theory. International Journal of Intelligent Systems, Special Issue on Dempster-Shafer Theory of Evidence, 2002. accepted for publication.
G. Shafer. The Mathematical Theory of Evidence. Princeton University Press, 1976.
Ph. Smets and R. Kennes. The transferable belief model. Artificial Intelligence, 66:191–234, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haenni, R. (2002). Argumentative Reasoning with ABEL. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_42
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive