Belief base contraction by belief accrual

DOI10.1016/J.ARTINT.2019.05.002MaRDI QIDQ2321321zbMATH OpenOpenAlexWikidataFDO

Authors Cristhian Ariel D. Deagustini, Marcelo A. Falappa, Guillermo R. Simari, Maria Vanina Martinez

Publication date 28 August 2019

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2019.05.002

zbMATH Keywords

belief revisionbelief base contraction

Mathematics Subject Classification ID

Knowledge representation (68T30) Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)

Recommendations

• On knowledge evolution: acquisition, revision, contraction
• Eligible contraction
• Conservative contraction
• Theory contraction and base contraction unified
• Minimal change: relevance and recovery revisited

Cites work

• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• scientific article; zbMATH DE number 4168658 (Why is no real title available?)
• scientific article; zbMATH DE number 3792134 (Why is no real title available?)
• scientific article; zbMATH DE number 1537944 (Why is no real title available?)
• A belief revision framework for revising epistemic states with partial epistemic states
• A framework for multi-agent belief revision
• A mathematical treatment of defeasible reasoning and its implementation.
• A practical approach to revising prioritized knowledge bases
• Argumentation in artificial intelligence
• Belief change. Introduction and overview
• Database querying under changing preferences
• Datalog\(^\pm\) ontology consolidation
• Dynamic belief revision operators
• Handbook of knowledge representation.
• How Dirty Is Your Relational Database? An Axiomatic Approach
• Inconsistency handling in Datalog\(+/-\) ontologies
• Iterated belief revision, revised
• Kernel contraction
• Knowledge in flux. Modeling the dynamics of epistemic states
• Local change
• Modelling argument accrual with possibilistic uncertainty in a logic programming setting
• On the logic of iterated belief revision
• On the logic of theory change: Partial meet contraction and revision functions
• On the logic of theory change: safe contraction
• On the revision of informant credibility orders
• Parallel belief revision: revising by sets of formulas
• Policy-based inconsistency management in relational databases
• Preferential belief change using generalized epistemic entrenchment
• Prioritized and non-prioritized multiple change on belief bases
• Prioritized repairing and consistent query answering in relational databases
• Propositional knowledge base revision and minimal change
• Rational belief change, Popper functions and counterfactuals
• Refined epistemic entrenchment
• Relevance in belief revision
• Subjunctives, dispositions and chances

Cited in

(3)

• Belief contraction without recovery
• Merging existential rules programs in multi-agent contexts through credibility accrual
• Belief revision and computational argumentation: a critical comparison

This page was built for publication: Belief base contraction by belief accrual

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