作者: Daan Fierens
DOI: 10.1007/978-3-642-13840-9_3
关键词: Probabilistic logic network 、 Functional logic programming 、 Subjective logic 、 Semantics 、 Probabilistic logic 、 Autoepistemic logic 、 Ontology language 、 Computer science 、 Statistical relational learning 、 Dynamic logic (modal logic) 、 Well-founded semantics 、 Description logic 、 Theoretical computer science 、 Logic programming 、 Fifth-generation programming language 、 Probabilistic CTL 、 Higher-order logic 、 Horn clause 、 Computational logic 、 Multimodal logic 、 Probabilistic argumentation 、 Inductive programming 、 Converse
摘要: A significant part of current research on (inductive) logic programming deals with probabilistic logical models. Over the last decade many logics or languages for representing such models have been introduced. There is currently a great need insight into relationships between all these languages. One kind are those that extend elements logic, as language Logical Bayesian Networks (LBNs). Some other follow converse strategy extending programs semantics, often in way similar to Sato's distribution semantics. In this paper we study relationship LBNs and based semantics. Concretely, define mapping from theories Independent Choice Logic (ICL). We also show how can be used learn ICL data.