In this paper we prove that all the existing conditional event algebras embed into a three-valued extension of temporal logic of discrete past time, which the authors of this paper have proposed in anothe paper as a general model of conditional events.
First of all, we discuss the descriptive incompleteness of the cea's. In this direction, we show that some important notions, like independence of conditional events, cannot be properly addressed in the framework of conditional event algebras, while they can be precisely formulated and analyzed in the temporal setting.
We also demonstrate that the embeddings allow one to use Markov chain algorithms (suitable for the temporal calculus) for computing probabilities of complex conditional expressions of the embedded conditional event algebras, and that these algorithms can outperform those previously known.
Predicate-Conditional Conformalized Answer Sets for Knowledge Graph Embeddings
University of Stuttgart(斯图加特大学);Bosch Center for AI(博世人工智能中心);University of Oxford(牛津大学);University of Cambridge(剑桥大学);Stanford University(斯坦福大学);University of Oslo(奥斯陆大学);University of Southampton(南安普顿大学)
Semantic Purification for Conditional Representation Learning
School of Computer Science and Engineering, Southeast University, China(计算机科学与工程学院,东南大学);Biomedicine Discovery Institute, Department of Biochemistry and Molecular Biology, Monash University, Australia(生物医学发现研究所,墨尔本大学)