Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
From MaRDI portal
Publication:5277783
DOI10.1145/1243996.1244001zbMath1367.68274OpenAlexW2085846695MaRDI QIDQ5277783
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1243996.1244001
Related Items
Four-valued paradefinite logics ⋮ Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ An Approach to Human-Level Commonsense Reasoning ⋮ Distance-based paraconsistent logics ⋮ Reasoning under inconsistency: a forgetting-based approach