Semi-stable semantics

DOI10.1093/LOGCOM/EXR033zbMath1267.68223DBLPjournals/logcom/CaminadaCD12OpenAlexW2039594639WikidataQ62044290 ScholiaQ62044290MaRDI QIDQ3165758

Martin Caminada, Paul E. Dunne, Walter Alexandre Carnielli

Publication date: 19 October 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

default logicnonmonotonic reasoninglogic programmingparaconsistent reasoningcomputational argumentation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic programming (68N17)

Related Items (30)

Looking-ahead in backtracking algorithms for abstract argumentation ⋮ Conflict-Tolerant Semantics for Argumentation Frameworks ⋮ On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ Normal and strong expansion equivalence for argumentation frameworks ⋮ Admissibility in Probabilistic Argumentation ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ On a paraconsistentization functor in the category of consequence structures ⋮ A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Improved answer-set programming encodings for abstract argumentation ⋮ Range-based argumentation semantics as two-valued models ⋮ Simple contrapositive assumption-based argumentation frameworks ⋮ A general approach to extension-based semantics in abstract argumentation ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Logical argumentation by dynamic proof systems ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ A postulate-driven study of logical argumentation ⋮ Classical logic, argument and dialectic ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ An extension-based approach to belief revision in abstract argumentation ⋮ Abstract argument games via modal logic ⋮ Restricted semantics for default reasoning ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ Design and results of the second international competition on computational models of argumentation ⋮ Probabilistic abstract argumentation frameworks, a possible world view ⋮ Normality, non-contamination and logical depth in classical natural deduction ⋮ Simple contrapositive assumption-based argumentation. II: Reasoning with preferences ⋮ Ensuring reference independence and cautious monotony in abstract argumentation ⋮ Structured argumentation dynamics. Undermining attacks in default justification logic ⋮ Graded labellings for abstract argumentation

Uses Software

• OSCAR

This page was built for publication: Semi-stable semantics