Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories

DOI10.1007/B11792MaRDI QIDQ5900655zbMATH OpenOpenAlexFDO

Authors P. Besnard, Torsten Schaub, Hans Tompits, Stefan Woltran

Publication date 6 April 2010

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

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

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Logic in artificial intelligence (68T27)

Recommendations

• Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
• Inconsistency Tolerance
• scientific article; zbMATH DE number 1931670
• scientific article; zbMATH DE number 1269574
• scientific article; zbMATH DE number 2080019

Cited in

(8)

• A QBF-based formalization of abstract argumentation semantics
• Computational methods for database repair by signed formulae
• Reasoning with different levels of uncertainty
• scientific article; zbMATH DE number 1931670 (Why is no real title available?)
• Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
• A SIMPLE APPROACH TOWARDS RECAPTURING CONSISTENT THEORIES IN PARACONSISTENT SETTINGS
• Inconsistency Tolerance
• Expressiveness of SETAFs and support-free ADFs under 3-valued semantics

Describes a project that uses

Uses Software

• QUBOS

This page was built for publication: Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories

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