Pages that link to "Item:Q1028947"

The following pages link to Computing ideal sceptical argumentation (Q1028947):

Displaying 50 items.

• Argument graphs and assumption-based argumentation (Q253995) (← links)
• Looking-ahead in backtracking algorithms for abstract argumentation (Q324699) (← links)
• Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
• Characterizing strong equivalence for argumentation frameworks (Q420788) (← links)
• A general framework for sound assumption-based argumentation dialogues (Q460606) (← links)
• Postulates for logic-based argumentation systems (Q465599) (← links)
• Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
• Uses and computation of imprecise probabilities from statistical data and expert arguments (Q505254) (← links)
• Instantiating abstract argumentation with classical logic arguments: postulates and properties (Q646494) (← links)
• Dynamics of argumentation systems: a division-based method (Q650522) (← links)
• A new approach for preference-based argumentation frameworks (Q766045) (← links)
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
• On efficiently estimating the probability of extensions in abstract argumentation frameworks (Q899472) (← links)
• An approach to abstract argumentation with recursive attack and support (Q901084) (← links)
• Argumentation in artificial intelligence (Q1028943) (← links)
• The computational complexity of ideal semantics (Q1045987) (← links)
• Arguing about informant credibility in open multi-agent systems (Q1647510) (← links)
• Inference procedures and engine for probabilistic argumentation (Q1678421) (← links)
• Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations (Q1711894) (← links)
• An extension-based approach to belief revision in abstract argumentation (Q1726407) (← links)
• Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
• Ensuring reference independence and cautious monotony in abstract argumentation (Q2069060) (← links)
• Assumption-based argumentation for extended disjunctive logic programming (Q2103901) (← links)
• Graded labellings for abstract argumentation (Q2105593) (← links)
• Revealed preference in argumentation: algorithms and applications (Q2237149) (← links)
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← 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)
• A logical account of formal argumentation (Q2269515) (← links)
• Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
• A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (Q2317506) (← links)
• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence (Q2321260) (← links)
• Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks (Q2321270) (← links)
• A comprehensive study of argumentation frameworks with sets of attacking arguments (Q2330011) (← links)
• Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
• Parametric properties of ideal semantics (Q2351031) (← links)
• Probabilistic qualification of attack in abstract argumentation (Q2353976) (← links)
• Labellings for assumption-based and abstract argumentation (Q2406908) (← links)
• Weighted argumentation for analysis of discussions in Twitter (Q2409095) (← links)
• On checking skeptical and ideal admissibility in abstract argumentation frameworks (Q2419797) (← links)
• Abstract argumentation and explanation applied to scientific debates (Q2441764) (← links)
• A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
• On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method'' (Q2453729) (← links)
• FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
• Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643) (← links)
• A general approach to extension-based semantics in abstract argumentation (Q2680804) (← links)
• A definition of sceptical semantics in the constellations approach (Q2694551) (← links)
• Collective argumentation with topological restrictions (Q2695507) (← links)
• Flexible dispute derivations with forward and backward arguments for assumption-based argumentation (Q2695513) (← links)