Preferred extensions as stable models

DOI10.1017/S1471068408003359zbMath1148.68012OpenAlexW2130003285MaRDI QIDQ3514892

Mauricio Osorio, Juan Carlos Nieves, Ulises Cortés

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

zbMATH Keywords

minimal modelsabstract argumentation semanticsstable model semanticspreferred semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (8)

An abstract argumentation and logic programming comparison based on 5-valued labellings ⋮ Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ Range-based argumentation semantics as two-valued models ⋮ Value-based argumentation framework built from prioritized qualitative choice logic ⋮ Algorithms for decision problems in argument systems under preferred semantics ⋮ Expressing Extension-Based Semantics Based on Stratified Minimal Models ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

Cites Work

• Graph theoretical structures in logic programs and default theories

This page was built for publication: Preferred extensions as stable models