Cost-bounded argumentation (Q5932223): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OSCAR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the algorithm of Heidtmann to non-monotone formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epistemic entrenchment and possibilistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An argumentation-theoretic foundation for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal framework for causal modeling and argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smaller sums of disjoint products by subproduct inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical theory of hints. An approach to the Dempster-Shafer theory of evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional information systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching agreements through argumentation: a logical model and implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nozick's Acceptance Rule and the Lottery Paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agents that reason and negotiate by arguing / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to reason defeasibly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Justification and defeat / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independent choice logic for modelling multiple agents under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic-based analysis of Dempster-Shafer theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical treatment of defeasible reasoning and its implementation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4244304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract argumentation systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:56, 3 June 2024

scientific article; zbMATH DE number 1595379
Language Label Description Also known as
English
Cost-bounded argumentation
scientific article; zbMATH DE number 1595379

    Statements

    Cost-bounded argumentation (English)
    0 references
    0 references
    6 May 2001
    0 references
    probabilistic argumentation systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers