Characterizability in Horn Belief Revision
From MaRDI portal
Publication:2835894
DOI10.1007/978-3-319-48758-8_32zbMath1483.03014OpenAlexW2542670467MaRDI QIDQ2835894
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_32
Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42)
Related Items
Cites Work
- Unnamed Item
- Construction of system of spheres-based transitively relational partial meet multiple contractions: an impossibility result
- Propositional knowledge base revision and minimal change
- Inter-definability of Horn contraction and Horn revision
- Belief revision in Horn theories
- Distance semantics for belief revision
- Characterizability in Horn Belief Revision
- Horn Clause Contraction Functions
- Reachability is harder for directed than for undirected finite graphs
- On the logic of theory change: Partial meet contraction and revision functions
- Horn Contraction via Epistemic Entrenchment
- Merging in the Horn Fragment
- Finite Model Theory
- On sentences which are true of direct unions of algebras
- The decision problem for some classes of sentences without quantifiers