A Query-Driven Anytime Algorithm for Argumentative and Abductive Reasoning

Authors:
Rolf Haenni
Affiliations:
-
Venue:
Soft-Ware 2002 Proceedings of the First International Conference on Computing in an Imperfect World
Year:
2002

Citing 6
Cited 2

An assumption-based TMS

Artificial Intelligence
Extending the ATMS

Artificial Intelligence
Problem solving with the ATMS

Artificial Intelligence
Assumptions, beliefs and probabilities

Artificial Intelligence
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
A Cost Bounded Possibilistic ATMS

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty

Argumentative Reasoning with ABEL

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Using probabilistic argumentation for key validation in public-key cryptography

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approximation methodfor computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm can be interrupted at any time returning the solution foundso far. The quality of the approximation increases monotonically when more computational resources are available. The methodis basedon cost functions andreturns lower and upper bounds.