Nadia Labai
YOU?
Author Swipe
View article: Automata-based Reasoning for Decidable Logics with Data Values
Automata-based Reasoning for Decidable Logics with Data Values Open
Decidable logics play a major role in knowledge representation, automated verification, and database management. A common ground relating many of these logics is the two-variable fragment of First Order logic (FO2), which is well-suited fo…
View article: An ExpTime Upper Bound for ALC with Integers
An ExpTime Upper Bound for ALC with Integers Open
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 usua…
View article: An ExpTime Upper Bound for $\mathcal{ALC}$ with Integers (Extended Version)
An ExpTime Upper Bound for $\mathcal{ALC}$ with Integers (Extended Version) Open
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 usua…
View article: An ExpTime Upper Bound for $\\mathcal{ALC}$ with Integers (Extended\n Version)
An ExpTime Upper Bound for $\\mathcal{ALC}$ with Integers (Extended\n Version) Open
Concrete domains, especially those that allow to compare features with\nnumeric values, have long been recognized as a very desirable extension of\ndescription logics (DLs), and significant efforts have been invested into\nadding them to u…
View article: Pebble-Intervals Automata and FO2 with Two Orders (Extended Version)
Pebble-Intervals Automata and FO2 with Two Orders (Extended Version) Open
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 important for reasoning about structures that use data values…
View article: On the exact learnability of graph parameters: The case of partition functions
On the exact learnability of graph parameters: The case of partition functions Open
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 $α$ and edge weights $β$. …
View article: On the Exact Learnability of Graph Parameters: The Case of Partition Functions
On the Exact Learnability of Graph Parameters: The Case of Partition Functions Open
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. M…