Towards log-linear logics with concrete domains

We present MEL ++ (M denotes Markov logic net- works) an extension of the log-linear description log- ics EL ++ -LL with concrete domains, nominals, and in- stances. We use Markov logic networks (MLNs) in or- der to find the most probable, classified and coherent EL ++ ontology from an 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.