A query-driven anytime algorithm for argumentative and abductive reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2311, Issue , 2002, Pages 114-127

  Haenni, Rolf ^a  

^a Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST FUNCTIONS;

ABDUCTIVE REASONING; ANY-TIME ALGORITHMS; COMPUTATIONAL RESOURCES;

COMPUTATION THEORY;

EID: 84958745623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46019-5_9     Document Type: Conference Paper

References (28)

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. K. B. Laskey and P. E. Lehner. Assumptions, beliefs andprobabilities. Artificial Intelligence, 41(1):65–77, 1989.
3. D. Berzati, R. Haenni, and J. Kohlas. Probabilistic argumentation systems and abduction. In C. Baral and M. Truszczynski, editors, Proccedings of the 8th International Workshop on Non-Monotonic Reasoning, Breckenridge Colorado, 2000.
4. J. Bigham, Z. Luo, and D. Banerjee. A cost boundedp ossibilistic ATMS. In Christine Froidevaux and Jürg Kohlas, editors, Proceedings of the ECSQARU Conference on Symbolic and Quantitive Approaches to Reasoning and Uncertainty, volume 946, pages 52–59, Berlin, 1995. Springer Verlag.
5. J. W. Collins and D. de Coste. CATMS: An ATMS which avoids label explosions. In Kathleen McKeown andThomas Dean, editors, Proceedings of the 9th National Conference on Artificial Intelligence, pages 281–287. MIT Press, 1991.
6. J. de Kleer. An assumption-based TMS. Artificial Intelligence, 28:127–162, 1986.
7. J. de Kleer. Extending the ATMS. Artificial Intelligence, 28:163–196, 1986.
8. J. de Kleer. Problem solving with the ATMS. Artificial Intelligence, 28:197–224, 1986.
9. J. de Kleer. Focusing on probable diagnoses. In Kathleen Dean, Thomas L.; McKeown, editor, Proceedings of the 9th National Conference on Artificial Intelligence, pages 842–848. MIT Press, 1991.
10. J. de Kleer. A perspective on assumption-based truth maintenance. Artificial Intelligence, 59(1–2):63–67, 1993.
11. T. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), pages 49–54. MIT Press, 1988.
12. T. L. Dean. Intrancibility and time-dependent planning. In M. P. Geofrey and A.L. Lansky, editors, Proceedings of the 1986 Workshop on Reasoning about Actions and Plans. Morgan Kaufmann Publishers, 1987.
13. R. Dechter. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence, 113(1–2):41–85, 1999.
14. K. D. Forbus and J. de Kleer. Focusing the ATMS. In Tom M. Smith andReidG. Mitchell, editors, Proceedings of the 7th National Conference on Artificial Intelligence, pages 193–198, St. Paul, MN, 1988. Morgan Kaufmann.
15. R. Haenni. Modeling uncertainty with propositional assumption-based systems. In S. Parson andA. Hunter, editors, Applications of Uncertainty Formalisms, Lecture Notes in Artifical Intelligence 1455, pages 446–470. Springer-Verlag, 1998.
16. R. Haenni. Cost-bounded argumentation. International Journal of Approximate Reasoning, 26(2):101–127, 2001.
17. R. Haenni, J. Kohlas, and N. Lehmann. Probabilistic argumentation systems. In J. Kohlas andS. Moral, editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 5: Algorithms for Uncertainty and Defeasible Reasoning. Kluwer, Dordrecht, 2000.
18. K. Inoue. An abductive procedure for the CMS/ATMS. In J. P. Martins and M. Reinfrank, editors, Truth Maintenance Systems, Lecture Notes in A.I., pages 34–53. Springer, 1991.
19. J. Kohlas and P. A. Monney. A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence, volume 425 of Lecture Notes in Economics and Mathematical Systems. Springer, 1995.
20. M. McLeish. Nilsson’s probabilistic entailment extended to Dempster-Shafer theory. In L. N. Kanal, T. S. Levitt, andJ. F. Lemmer, editors, Uncertainty in Artificial Intelligence, volume 8, pages 23–34. North-Holland, Amsterdam, 1987.
21. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988.
22. G. M. Provan. A logic-basedanalysis of Dempster-Shafer theory. International Journal of Approximate Reasoning, 4:451–495, 1990.
23. R. Reiter and J. de Kleer. Foundations of assumption-based truth maintenance systems: Preliminary report. In Kenneth Forbus andHo wardShrob e, editors, Proceedings of the Sixth National Conference on Artificial Intelligence, pages 183– 188. American Association for Artificial Intelligence, AAAI Press, 1987.
24. G. Shafer. The Mathematical Theory of Evidence. Princeton University Press, 1976.
25. P. P. Shenoy. Binary join trees. In Eric Horvitz andFinn Jensen, editors, Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI-96), pages 492–499, San Francisco, 1996. Morgan Kaufmann Publishers.
26. Ph. Smets. Probability of provability andb elief functions. In M. Clarke, R. Kruse R., andS. Moral, editors, Proceedings of the ECSQARU’93 conference, pages 332– 340. Springer-Verlag, 1993.
27. Ph. Smets and R. Kennes. The transferable belief model. Artificial Intelligence, 66:191–234, 1994.
28. S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, Fall:71–83, 1996.