Reasoning with maximal consistency by argumentative approaches

DOI10.1093/logcom/exy027zbMath1444.68175OpenAlexW2894866730MaRDI QIDQ4612449

Ofer Arieli, Annemarie Borg, Christian Straßer

Publication date: 31 January 2019

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

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

zbMATH Keywords

non-monotonic reasoningsequent calculiargumentation frameworksdynamic proofsmaximal consistency

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (7)

Simple contrapositive assumption-based argumentation frameworks ⋮ Logical argumentation by dynamic proof systems ⋮ A postulate-driven study of logical argumentation ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ A review of the relations between logical argumentation and reasoning with maximal consistency ⋮ Simple contrapositive assumption-based argumentation. II: Reasoning with preferences

This page was built for publication: Reasoning with maximal consistency by argumentative approaches