Pages that link to "Item:Q2269515"
From MaRDI portal
The following pages link to A logical account of formal argumentation (Q2269515):
Displayed 50 items.
- Optimization of dialectical outcomes in dialogical argumentation (Q324665) (← links)
- Looking-ahead in backtracking algorithms for abstract argumentation (Q324699) (← links)
- Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
- Probabilistic argumentation: an equational approach (Q497876) (← links)
- Graph aggregation (Q514143) (← links)
- Theory of semi-instantiation in abstract argumentation (Q528522) (← links)
- Equilibrium states in numerical argumentation networks (Q895825) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks (Q901144) (← links)
- On the impact of configuration on abstract argumentation automated reasoning (Q1687275) (← links)
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation (Q1711893) (← links)
- Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations (Q1711894) (← links)
- From fine-grained properties to broad principles for gradual argumentation: a principled spectrum (Q1726355) (← links)
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches (Q1726415) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- A logic of argumentation for specification and verification of abstract argumentation frameworks (Q1935593) (← links)
- Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger (Q1941728) (← links)
- A generalized proof-theoretic approach to logical argumentation based on hypersequents (Q2021565) (← links)
- Event-based time-stamped claim logic (Q2043818) (← links)
- Graded labellings for abstract argumentation (Q2105593) (← links)
- Generalizing complete semantics to bipolar argumentation frameworks (Q2146009) (← links)
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility (Q2163881) (← links)
- Semantics for higher level attacks in extended argumentation frames. I: Overview (Q2269507) (← links)
- Fibring argumentation frames (Q2269514) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- Realizability of three-valued semantics for abstract dialectical frameworks (Q2287192) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- Delegated updates in epistemic graphs for opponent modelling (Q2302776) (← links)
- A polynomial-time fragment of epistemic probabilistic argumentation (Q2302822) (← links)
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments (Q2303513) (← links)
- A comprehensive study of argumentation frameworks with sets of attacking arguments (Q2330011) (← links)
- On three-valued acceptance conditions of abstract dialectical frameworks (Q2333663) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- On the equivalence between logic programming semantics and argumentation semantics (Q2344367) (← links)
- Labellings for assumption-based and abstract argumentation (Q2406908) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- A general approach to extension-based semantics in abstract argumentation (Q2680804) (← links)
- TOWARD A COMPUTATIONAL ANALYSIS OF PROBABILISTIC ARGUMENTATION FRAMEWORKS (Q2790367) (← links)
- An Equational Approach to Logic Programming (Q2900525) (← links)
- Conflict-Tolerant Semantics for Argumentation Frameworks (Q2915055) (← links)
- Introducing Equational Semantics for Argumentation Networks (Q3011932) (← links)
- Principles Of Talmudic Logic (Q3305655) (← links)
- (Q3384088) (← links)
- Modal and Temporal Argumentation Networks (Q3587249) (← links)
- Abduction in argumentation frameworks (Q4685530) (← links)
- Admissibility in Probabilistic Argumentation (Q5094045) (← links)
- Judgment Aggregation in Abstract Dialectical Frameworks (Q5172622) (← links)