Range-based argumentation semantics as two-valued models
From MaRDI portal
Publication:4593079
DOI10.1017/S1471068416000090zbMath1379.68299arXiv1602.08903OpenAlexW2963382493MaRDI QIDQ4593079
Mauricio Osorio, Juan Carlos Nieves
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.08903
Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items (2)
An argumentation-based approach for identifying and dealing with incompatibilities among procedural goals ⋮ Ensuring reference independence and cautious monotony in abstract argumentation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating operators and semantics for abstract dialectical frameworks
- Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday
- Complexity of semi-stable and stage semantics in argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Logical modes of attack in argumentation networks
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Ideal extensions as logical programming models
- A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory
- Semi-stable semantics
- Logics with Common Weak Completions
- Preferred extensions as stable models
- Knowledge Representation, Reasoning and Declarative Problem Solving
This page was built for publication: Range-based argumentation semantics as two-valued models