arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.02456cs.AI
收藏

Towards Log-Linear Logics with Concrete Domains

Universität Mannheim(曼海姆大学)

Melisachew Wudage Chekol, Jakob Huber, Heiner Stuckenschmidt

英文摘要:

We present $\mathcal{MEL}^{++}$ (M denotes Markov logic networks) an extension of the log-linear description logics $\mathcal{EL}^{++}$-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent $\mathcal{EL}^{++}$ ontology from an $\mathcal{MEL}^{++}$ knowledge base. In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending MLN's cutting plane inference (CPI) algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑