Preferred extensions as stable models
From MaRDI portal
Publication:3514892
Recommendations
Cited in
(14)- Algorithms for decision problems in argument systems under preferred semantics
- Minimal hypotheses: extension-based semantics to argumentation
- Ideal extensions as logical programming models
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- The first international competition on computational models of argumentation: results and analysis
- Expressing Extension-Based Semantics Based on Stratified Minimal Models
- Value-based argumentation framework built from prioritized qualitative choice logic
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- Range-based argumentation semantics as two-valued models
- scientific article; zbMATH DE number 1769206 (Why is no real title available?)
- An abstract argumentation and logic programming comparison based on 5-valued labellings
- Short note preferred extensions are partial stable models
- 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)