Preference-based belief revision for rule-based agents
From MaRDI portal
Publication:1024129
DOI10.1007/S11229-008-9364-0zbMATH Open1170.03006OpenAlexW1990982254MaRDI QIDQ1024129FDOQ1024129
Natasha Alechina, Mark Jago, Brian Logan
Publication date: 16 June 2009
Published in: Synthese (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11229-008-9364-0
Cites Work
- Belief contraction without recovery
- On the logic of theory change: Partial meet contraction and revision functions
- On the logic of theory change: safe contraction
- Title not available (Why is that?)
- On the status of the postulate of recovery in the logic of theory change
- Propositional knowledge base revision and minimal change
- Semi-revision
- Kernel contraction
- Title not available (Why is that?)
- Theory contraction and base contraction unified
- The complexity of nested counterfactuals and iterated knowledge base revisions
- Title not available (Why is that?)
- Approximate belief revision
- Title not available (Why is that?)
- Theory-Contraction is NP-Complete
- New foundations for a relational theory of theory-revision
- Title not available (Why is that?)
Cited In (3)
Recommendations
This page was built for publication: Preference-based belief revision for rule-based agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024129)