On the complexity of paraconsistent inference relations

DOI10.1007/978-3-540-30597-2_6MaRDI QIDQ5464030zbMATH OpenOpenAlexFDO

Authors Sylvie Coste-Marquis, Pierre Marquis

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104925

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in artificial intelligence (68T27)

Recommendations

• Resource-bounded paraconsistent inference
• scientific article; zbMATH DE number 1269574
• Some recent applications of paraconsistent systems to AI
• Three-valued logics for inconsistency handling
• A survey of complexity results for non-monotonic logics

Cited in

(5)

• Resource-bounded paraconsistent inference
• Inducing inference relations from inconsistency measures
• Recovering Consistency by Forgetting Inconsistency
• The Complexity of Circumscriptive Inference in Post’s Lattice
• scientific article; zbMATH DE number 1778912 (Why is no real title available?)

This page was built for publication: On the complexity of paraconsistent inference relations

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