ABEL: An interactive tool for probabilistic argumentative reasoning

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2711, Issue , 2003, Pages 588-593

  Haenni, Rolf ^a   Lehmann, Norbert ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; KNOWLEDGE ACQUISITION; PROBLEM SOLVING; QUERY LANGUAGES; COMPUTERS;

COUNTER-ARGUMENTS; NUMERICAL WEIGHTS; PROBABILISTIC ARGUMENTATION SYSTEMS; QUALITATIVE ASPECTS; FORMAL APPROACH; INTERACTIVE TOOL; LOGIC AND PROBABILITY; REASONING UNDER UNCERTAINTY;

PROBABILISTIC LOGICS; UNCERTAINTY ANALYSIS;

EID: 8344250960     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-45062-7_48     Document Type: Conference Paper

References (16)

1. 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 Fribourg, 1999.
2. 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, Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning ECSQARU/FAPR'97, LNCS 1146, pages 171-182. Springer, 1997.
3. B. Anrig, R. Haenni, and N. Lehmann. ABEL - a new language for assumption-based evidential reasoning under uncertainty. Technical Report 97-01, Institute of Informatics, University of Fribourg, 1997.
4. D. Berzati, R. Haenni, and J. Kohlas. Probabilistic argumentation systems and abduction. Annals of Mathematics and Artificial Intelligence, 34(1-3):177-195, 2002.
5. A. Darwiche. A compiler for deterministic, decomposable negation normal form. In Proceedings of the 18th National Conference on Artificial Intelligence, pages 627-634. AAAI Press, 2002.
6. J. de Kleer. An assumption-based TMS. Artificial Intelligence, 28:127-162, 1986.
7. R. Haenni. Cost-bounded argumentation. International Journal of Approximate Reasoning, 26(2):101-127, 2001.
8. 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, LNCS 2311, pages 114-127. Springer-Verlag, 2002.
9. 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, pages 221-288. Kluwer, Dordrecht, 2000.
10. R. Haenni and N. Lehmann. Probabilistic argumentation systems: a new perspective on Dempster-Shafer theory. International Journal of Intelligent Systems (Special Issue: the Dempster-Shafer Theory of Evidence), 18(1):93-106, 2003.
11. D. Poole. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64:81-129, 1993.
12. A. Saffiotti and E. Umkehrer. PULCINELLA: A general tool for propagating uncertainty in valuation networks. Technical report, IRIDIA, Université de Bruxelles, 1991.
13. G. Shafer. The Mathematical Theory of Evidence. Princeton University Press, 1976.
14. Ph. Smets and R. Kennes. The transferable belief model. Artificial Intelligence, 66:191-234, 1994.
15. R. Stallman and B. Wing. XEmacs User's Manual, 1994.
16. G.L. Steele. Common Lisp - the Language. Digital Press, 1990.