3 papers
cs.AI2020
An ExpTime Upper Bound for with Integers (Extended Version)
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 sign…
cs.LO2019
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
Nadia Labai, Tomer Kotek, Magdalena Ortiz +1
We introduce a novel automata model, called pebble-intervals automata (PIA), and study its power and closure properties. PIAs are tailored for a decidable fragment of FO that is im…
cs.LG2016
On the exact learnability of graph parameters: The case of partition functions
Nadia Labai, Johann A. Makowsky
We study the exact learnability of real valued graph parameters which are known to be representable as partition functions which count the number of weighted homomorphisms into…