no code implementations • 3 Jun 2020 • Nadia Labai, Magdalena Ortiz, Mantas Šimkus
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual DLs while keeping the complexity of reasoning in check.
no code implementations • 13 Jun 2016 • Nadia Labai, Johann A. Makowsky
We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\alpha$ and edge weights $\beta$.
