Ideal extensions as logical programming models

DOI10.1093/LOGCOM/EXU014MaRDI QIDQ2957950zbMATH OpenOpenAlexFDO

Authors Juan Carlos Nieves, Mauricio Osorio

Publication date 31 January 2017

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/e16d251a7fcca42ccc67b56e6d6b41f740743fa5

zbMATH Keywords

nonmonotonic reasoninglogic programmingargumentation semantics

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Logical limits of abstract argumentation frameworks
• A logical account of formal argumentation
• On the semantics of abstract argumentation frameworks: a logic programming approach
• The computational complexity of ideal semantics
• Preferred extensions as stable models

Cited in

(6)

• On the semantics of abstract argumentation frameworks: a logic programming approach
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Preferred extensions as stable models
• Idealization in applied first-order logic
• Parametric properties of ideal semantics
• Range-based argumentation semantics as two-valued models

This page was built for publication: Ideal extensions as logical programming models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957950)