Characterizability in Horn belief revision
From MaRDI portal
Publication:2835894
DOI10.1007/978-3-319-48758-8_32zbMATH Open1483.03014OpenAlexW2542670467MaRDI QIDQ2835894FDOQ2835894
Authors: Jon Yaggie, Gy. Turán 
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
Recommendations
Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)
Cites Work
- Construction of system of spheres-based transitively relational partial meet multiple contractions: an impossibility result
- On the logic of theory change: Partial meet contraction and revision functions
- The decision problem for some classes of sentences without quantifiers
- Propositional knowledge base revision and minimal change
- Reachability is harder for directed than for undirected finite graphs
- On sentences which are true of direct unions of algebras
- Finite Model Theory
- Distance semantics for belief revision
- Title not available (Why is that?)
- Horn contraction via epistemic entrenchment
- Belief revision in Horn theories
- Horn clause contraction functions
- Inter-definability of Horn contraction and Horn revision
- Characterizability in Horn belief revision
- Merging in the Horn fragment
Cited In (4)
This page was built for publication: Characterizability in Horn belief revision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835894)
