Pages that link to "Item:Q672050"
From MaRDI portal
The following pages link to Graph theoretical structures in logic programs and default theories (Q672050):
Displaying 40 items.
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics (Q334820) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Kernels in digraphs that are not kernel perfect (Q442354) (← links)
- Propositional discourse logic (Q484942) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
- On the resolution-based family of abstract argumentation semantics and its grounded instance (Q543626) (← links)
- Verification in incomplete argumentation frameworks (Q668774) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- Audiences in argumentation frameworks (Q1028897) (← links)
- Argumentation in artificial intelligence (Q1028943) (← links)
- Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Alternative foundations for Reiter's default logic (Q1589575) (← links)
- An extension-based approach to belief revision in abstract argumentation (Q1726407) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Coherence in finite argument systems. (Q1852853) (← links)
- On the equivalence and range of applicability of graph-based representations of logic programs. (Q1853147) (← links)
- A nondeterministic well-founded semantics (Q1924729) (← links)
- Graph-classes of argumentation frameworks with collective attacks (Q2055773) (← links)
- Indepth combinatorial analysis of admissible sets for abstract argumentation (Q2107484) (← links)
- Complexity of nonemptiness in control argumentation frameworks (Q2146008) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface (Q2299238) (← links)
- Strong inconsistency (Q2321259) (← links)
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Labellings for assumption-based and abstract argumentation (Q2406908) (← links)
- On the preferred extensions of argumentation frameworks: bijections with naive sets (Q2681398) (← links)
- Opposition Frameworks (Q2835871) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Handling controversial arguments (Q3400791) (← links)
- Lattice point of view for argumentation framework (Q6059223) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
- Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)
