A preferential framework for trivialization-resistant reasoning with inconsistent information

DOI10.1007/978-3-642-33353-8_36MaRDI QIDQ2915092zbMATH OpenOpenAlexFDO

Authors Anna Zamansky

Publication date 21 September 2012

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33353-8_36

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

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
• 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
• scientific article; zbMATH DE number 2080023 (Why is no real title available?)
• scientific article; zbMATH DE number 1931671 (Why is no real title available?)
• 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

Cited in

(1)

• A framework for reasoning with soft information

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)