Preferred extensions as stable models
From MaRDI portal
Publication:3514892
DOI10.1017/S1471068408003359zbMATH Open1148.68012OpenAlexW2130003285MaRDI QIDQ3514892FDOQ3514892
Authors: Juan Carlos Nieves, Ulises Cortés, Mauricio Osorio
Publication date: 23 July 2008
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068408003359
Recommendations
Cites Work
Cited In (12)
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Expressing Extension-Based Semantics Based on Stratified Minimal Models
- An abstract argumentation and logic programming comparison based on 5-valued labellings
- Title not available (Why is that?)
- Algorithms for decision problems in argument systems under preferred semantics
- Minimal hypotheses: extension-based semantics to argumentation
- Value-based argumentation framework built from prioritized qualitative choice logic
- Range-based argumentation semantics as two-valued models
- Short note preferred extensions are partial stable models
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- The first international competition on computational models of argumentation: results and analysis
- Methods for solving reasoning problems in abstract argumentation -- a survey
This page was built for publication: Preferred extensions as stable models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514892)