A preferential framework for trivialization-resistant reasoning with inconsistent information
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1269574
- Inferring from inconsistency in preference-based argumentation frameworks
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Resource-bounded paraconsistent inference
Cites work
- \(\text{DA}^2\) merging operators
- A logical framework for integrating inconsistent information in multiple databases
- Applications of paraconsistency in data and knowledge bases
- Distance-based paraconsistent logics
- Efficient reasoning about rich temporal domains
- Formal inconsistency and evolutionary databases
- General patterns for nonmonotonic reasoning: from basic entailments to plausible relations
- Ideal paraconsistent logics
- Logics of formal inconsistency
- Nonmonotonic reasoning, preferential models and cumulative logics
- On the theory of inconsistent formal systems
- Operators and Laws for Combining Preference Relations
- Three-valued logics for inconsistency handling
This page was built for publication: A preferential framework for trivialization-resistant reasoning with inconsistent information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915092)