Pages that link to "Item:Q1852857"

The following pages link to On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857):

Displaying 18 items.

• Argument graphs and assumption-based argumentation (Q253995) (← links)
• Uses and computation of imprecise probabilities from statistical data and expert arguments (Q505254) (← links)
• Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
• Dynamics of argumentation systems: a division-based method (Q650522) (← links)
• Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
• Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
• Argumentation in artificial intelligence (Q1028943) (← links)
• Computing ideal sceptical argumentation (Q1028947) (← links)
• Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
• An application of formal argumentation: fusing Bayesian networks in multi-agent systems (Q1028951) (← links)
• The computational complexity of ideal semantics (Q1045987) (← links)
• On argumentation logic and propositional logic (Q1743995) (← links)
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
• Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643) (← links)
• Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability (Q3305685) (← links)
• Handling controversial arguments (Q3400791) (← links)
• Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation (Q6063862) (← links)