Reducing Preferential Paraconsistent Reasoning to Classical Entailment

DOI10.1093/logcom/13.4.557zbMath1034.03023OpenAlexW2140783059MaRDI QIDQ4434614

Marc Denecker, Ofer Arieli

Publication date: 10 November 2003

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/124184

zbMATH Keywords

many-valued logicclassical logiccircumscriptionpreferential semanticsparaconsistent reasoning

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Paraconsistent logics (03B53)

Related Items

Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Four-valued paradefinite logics, An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics, Unnamed Item, A QBF-based formalization of abstract argumentation semantics, Restricted semantics for default reasoning, Distance-based paraconsistent logics, Computational methods for database repair by signed formulae, Galois connections for bilattices, A solver for QBFs in negation normal form, Reasoning with different levels of uncertainty