Search Results for author:
Found 6 papers, 3 papers with code
Query Answering with Transitive and Linear-Ordered Data
We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of distinguished relations.
Dynamic Membership for Regular Languages
We show that the problem is in O(log log |w|) for languages in an algebraically-defined, decidable class QSG, and that it is in O(1) for another such class QLZG.
Formal Languages and Automata Theory Data Structures and Algorithms
Locality and Centrality: The Variety ZG
We study the variety ZG of monoids where the elements that belong to a group are central, i. e., commute with all other elements.
Formal Languages and Automata Theory
Constant-Delay Enumeration for Nondeterministic Document Spanners
We refute this and show that, given a nondeterministic sequential VA and an input document, we can enumerate the mappings of the VA on the document with the following bounds: the preprocessing is linear in the document size and polynomial in the size of the VA, and the delay is independent of the document and polynomial in the size of the VA.
Smoothing Structured Decomposable Circuits
Further, for the important case of All-Marginals, we show a more efficient linear-time algorithm.
Constant-Delay Enumeration for Nondeterministic Document Spanners
We refute this and show that, given a nondeterministic sequential VA and an input document, we can enumerate the mappings of the VA on the document with the following bounds: the preprocessing is linear in the document size and polynomial in the size of the VA, and the delay is independent of the document and polynomial in the size of the VA.
