Coherence in finite argument systems.
From MaRDI portal
Publication:1852853
DOI10.1016/S0004-3702(02)00261-8zbMath1043.68098OpenAlexW2149567024WikidataQ58168648 ScholiaQ58168648MaRDI QIDQ1852853
Paul E. Dunne, Trevor J. M. Bench-Capon
Publication date: 21 January 2003
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00261-8
Reasoning under uncertainty in the context of artificial intelligence (68T37) Semantics in the theory of computing (68Q55)
Related Items
Backdoors to Satisfaction, On rejected arguments and implicit conflicts: the hidden power of argumentation semantics, The first international competition on computational models of argumentation: results and analysis, Minimal hypotheses: extension-based semantics to argumentation, On checking skeptical and ideal admissibility in abstract argumentation frameworks, Improved answer-set programming encodings for abstract argumentation, Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks, The complexity landscape of claim-augmented argumentation frameworks, Characteristics of multiple viewpoints in abstract argumentation, Fundamental properties of attack relations in structured argumentation with priorities, Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory, A postulate-driven study of logical argumentation, Taking into account ``who said what in abstract argumentation: complexity results, Solving problems in the polynomial hierarchy with ASP(Q), Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks, Towards an Extensible Argumentation System, On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation, Complexity of semi-stable and stage semantics in argumentation frameworks, An extension-based approach to belief revision in abstract argumentation, On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method, Dialectic proof procedures for assumption-based, admissible argumentation, Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems, Complexity-sensitive decision procedures for abstract argumentation, Verification in incomplete argumentation frameworks, Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability, Updating Argumentation Frameworks for Enforcing Extensions, Acceptance in incomplete argumentation frameworks, Towards fixed-parameter tractable algorithms for abstract argumentation, Augmenting tractable fragments of abstract argumentation, Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks, What Is a Reasonable Argumentation Semantics?, Weighted argument systems: basic definitions, algorithms, and complexity results, On the resolution-based family of abstract argumentation semantics and its grounded instance, Valid attacks in argumentation frameworks with recursive attacks, Design and results of the second international competition on computational models of argumentation, EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface, Graph-classes of argumentation frameworks with collective attacks, Expressing Extension-Based Semantics Based on Stratified Minimal Models, Audiences in argumentation frameworks, Argumentation in artificial intelligence, Computational properties of argument systems satisfying graph-theoretic constraints, On the merging of Dung's argumentation systems, Handling controversial arguments, Opposition Frameworks, Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence, A general notion of equivalence for abstract argumentation, Modelling last-act attempted crime in criminal law, The computational complexity of ideal semantics, Encoding deductive argumentation in quantified Boolean formulae, Complexity of abstract argumentation under a claim-centric view, Methods for solving reasoning problems in abstract argumentation -- a survey, Indepth combinatorial analysis of admissible sets for abstract argumentation, Two party immediate response disputes: Properties and efficiency
Cites Work
- Graph theoretical structures in logic programs and default theories
- Two party immediate response disputes: Properties and efficiency
- Complete sets and the polynomial-time hierarchy
- An abstract, argumentation-theoretic approach to default reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Default reasoning using classical logic
- Kernels in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
