Representing paraconsistent reasoning via quantified propositional logic
From MaRDI portal
Recommendations
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
- Paraconsistent reasoning via quantified Boolean formulas. I: Axiomatising signed systems
- Automatic reasoning in paraconsistent logic
- A knowledge representation perspective: Logics for paraconsistent reasoning
Cited in
(10)- A solver for QBFs in negation normal form
- Resource-bounded paraconsistent inference
- A QBF-based formalization of abstract argumentation semantics
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment
- Paraconsistent reasoning via quantified Boolean formulas. I: Axiomatising signed systems
- scientific article; zbMATH DE number 910433 (Why is no real title available?)
- scientific article; zbMATH DE number 7455717 (Why is no real title available?)
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories
- Logic, arguments and inconsistencies: an introduction to the festschrift in honour of Philippe Besnard
This page was built for publication: Representing paraconsistent reasoning via quantified propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464028)