Cost-bounded argumentation
From MaRDI portal
Publication:5932223
DOI10.1016/S0888-613X(00)00063-3zbMath0970.68170MaRDI QIDQ5932223
Publication date: 6 May 2001
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Related Items (3)
Probabilistic argumentation ⋮ Using probabilistic argumentation for key validation in public-key cryptography ⋮ Probabilistic qualification of attack in abstract argumentation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic-based analysis of Dempster-Shafer theory
- A mathematical treatment of defeasible reasoning and its implementation.
- Probabilistic logic
- Epistemic entrenchment and possibilistic logic
- How to reason defeasibly
- Reaching agreements through argumentation: a logical model and implementation
- Justification and defeat
- The independent choice logic for modelling multiple agents under uncertainty
- Abstract argumentation systems
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence
- An Improved Algorithm for Network Reliability
- Agents that reason and negotiate by arguing
- Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation
- An argumentation-theoretic foundation for logic programming
- Nozick's Acceptance Rule and the Lottery Paradox
- A formal framework for causal modeling and argumentation
- Smaller sums of disjoint products by subproduct inversion
- Propositional information systems
- A machine program for theorem-proving
- A generalization of the algorithm of Heidtmann to non-monotone formulas
This page was built for publication: Cost-bounded argumentation
