Pages that link to "Item:Q1855240"

The following pages link to On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games (Q1855240):

Displaying 50 items.

• Valid attacks in argumentation frameworks with recursive attacks (Q2029707) (← links)
• \textsc{influence}: a partizan scoring game on graphs (Q2043009) (← links)
• Explanation in AI and law: past, present and future (Q2046030) (← links)
• Graph-classes of argumentation frameworks with collective attacks (Q2055773) (← links)
• Introducing a tool for concurrent argumentation (Q2055775) (← links)
• Probabilistic argumentation: an approach based on conditional probability. A preliminary report (Q2055776) (← links)
• Evaluation of argument strength in attack graphs: foundations and semantics (Q2060740) (← links)
• Simple contrapositive assumption-based argumentation. II: Reasoning with preferences (Q2060783) (← links)
• Bayesian belief revision based on Agent's criteria (Q2062195) (← links)
• Ensuring reference independence and cautious monotony in abstract argumentation (Q2069060) (← links)
• Structured argumentation dynamics. Undermining attacks in default justification logic (Q2075383) (← links)
• Assumption-based argumentation for extended disjunctive logic programming (Q2103901) (← links)
• Graded labellings for abstract argumentation (Q2105593) (← links)
• Indepth combinatorial analysis of admissible sets for abstract argumentation (Q2107484) (← links)
• Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
• An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms (Q2124445) (← links)
• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
• Gödel semantics of fuzzy argumentation frameworks with consistency degrees (Q2130020) (← links)
• Non-monotonic explanation functions (Q2145997) (← links)
• Necessary and sufficient explanations for argumentation-based conclusions (Q2146001) (← links)
• Addressing popular concerns regarding COVID-19 vaccination with natural language argumentation dialogues (Q2146003) (← links)
• Argument strength in probabilistic argumentation using confirmation theory (Q2146004) (← links)
• The degrees of monotony-dilemma in abstract argumentation (Q2146005) (← links)
• Constrained incomplete argumentation frameworks (Q2146007) (← links)
• Complexity of nonemptiness in control argumentation frameworks (Q2146008) (← links)
• Generalizing complete semantics to bipolar argumentation frameworks (Q2146009) (← links)
• Philosophical reflections on argument strength and gradual acceptability (Q2146010) (← links)
• An abstract argumentation and logic programming comparison based on 5-valued labellings (Q2146012) (← links)
• A paraconsistent approach to deal with epistemic inconsistencies in argumentation (Q2146014) (← links)
• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility (Q2163881) (← links)
• Simple contrapositive assumption-based argumentation frameworks (Q2191233) (← links)
• A probabilistic deontic argumentation framework (Q2206475) (← links)
• Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
• Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support (Q2211865) (← links)
• Revealed preference in argumentation: algorithms and applications (Q2237149) (← links)
• Information graphs and their use for Bayesian network graph construction (Q2237518) (← links)
• Argumentative explanations for interactive recommendations (Q2238596) (← links)
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
• Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
• Incremental computation for structured argumentation over dynamic DeLP knowledge bases (Q2238730) (← links)
• t-DeLP: an argumentation-based temporal defeasible logic programming framework (Q2248517) (← links)
• Using argument strength for building dialectical bonsai (Q2248521) (← links)
• Argumentation frameworks as constraint satisfaction problems (Q2248522) (← links)
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming (Q2269506) (← links)
• Meta-argumentation modelling. I: Methodology and techniques (Q2269509) (← links)
• Modal provability foundations for argumentation networks (Q2269511) (← links)
• Fibring argumentation frames (Q2269514) (← links)
• A logical account of formal argumentation (Q2269515) (← links)
• Annotation theories over finite graphs (Q2269516) (← links)
• Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification (Q2270426) (← links)