11 citations · 17 across the 5 of their papers we have counts for
7 papers
A Neurosymbolic Approach to Natural Language Formalization and Verification
Chenyang An, Sam Bayless, Stefano Buliani +27
Large Language Models perform well at natural language interpretation and reasoning, but their lack of formal correctness guarantees limits their adoption in regulated industries l…
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…
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…
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…
Logics of Finite Hankel Rank
Nadia Labai, Johann A. Makowsky
We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures an…
Finiteness conditions for graph algebras over tropical semirings
Nadia Labai, Johann A. Makowsky
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lov{á}sz and A. Schrijver (2007). Graph parameters with connection matrices…