Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae

DOI10.1145/1243996.1244001MaRDI QIDQ5277783zbMATH OpenOpenAlexFDO

Authors Ofer Arieli

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

zbMATH Keywords

nonmonotonic reasoningparaconsistent reasoningpreferential semanticsquantified Boolean formulae

Mathematics Subject Classification ID

Many-valued logic (03B50) Paraconsistent logics (03B53) Logic in artificial intelligence (68T27)

Recommendations

• Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
• scientific article; zbMATH DE number 1931670
• Inconsistency Tolerance
• Reducing Preferential Paraconsistent Reasoning to Classical Entailment
• Preferential logics for reasoning with graded uncertainty

Cited in

(12)

• Four-valued paradefinite logics
• Distance-based paraconsistent logics
• A QBF-based formalization of abstract argumentation semantics
• A preferential framework for trivialization-resistant reasoning with inconsistent information
• Reducing Preferential Paraconsistent Reasoning to Classical Entailment
• scientific article; zbMATH DE number 1931670 (Why is no real title available?)
• An approach to human-level commonsense reasoning
• Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
• Inconsistency Tolerance
• Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
• Reasoning under inconsistency: a forgetting-based approach

This page was built for publication: Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae

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