Cost-bounded argumentation

DOI10.1016/S0888-613X(00)00063-3MaRDI QIDQ5932223zbMATH OpenFDO

Authors R. Haenni

Publication date 6 May 2001

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0888-613X(00)00063-3

zbMATH Keywords

probabilistic argumentation systems

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 2086469
• Toward a computational analysis of probabilistic argumentation frameworks
• Formulating semantics of probabilistic argumentation by characterizing subgraphs
• Inference procedures and engine for probabilistic argumentation
• On the complexity of probabilistic abstract argumentation frameworks

Cites work

• scientific article; zbMATH DE number 4166925 (Why is no real title available?)
• scientific article; zbMATH DE number 140416 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 1292296 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• A formal framework for causal modeling and argumentation
• A generalization of the algorithm of Heidtmann to non-monotone formulas
• A logic-based analysis of Dempster-Shafer theory
• A machine program for theorem-proving
• A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
• A mathematical treatment of defeasible reasoning and its implementation.
• Abstract argumentation systems
• Agents that reason and negotiate by arguing
• An Improved Algorithm for Network Reliability
• An argumentation-theoretic foundation for logic programming
• Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
• Epistemic entrenchment and possibilistic logic
• How to reason defeasibly
• Justification and defeat
• Nozick's Acceptance Rule and the Lottery Paradox
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• Probabilistic argumentation systems
• Probabilistic logic
• Propositional information systems
• Reaching agreements through argumentation: a logical model and implementation
• Smaller sums of disjoint products by subproduct inversion
• The independent choice logic for modelling multiple agents under uncertainty

Cited in

(7)

• scientific article; zbMATH DE number 2086469 (Why is no real title available?)
• scientific article; zbMATH DE number 2231113 (Why is no real title available?)
• Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence
• Using probabilistic argumentation for key validation in public-key cryptography
• Probabilistic argumentation
• Inference procedures and engine for probabilistic argumentation
• Probabilistic qualification of attack in abstract argumentation

Describes a project that uses

Uses Software

• OSCAR

This page was built for publication: Cost-bounded argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932223)