Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Thompson, Sam M."'
Despite considerable research on document spanners, little is known about the expressive power of generalized core spanners. In this paper, we use Ehrenfeucht-Fra\"iss\'e games to obtain general inexpressibility lemmas for the logic FC (a finite-mode
Externí odkaz:
http://arxiv.org/abs/2306.16364
Autor:
Thompson, Sam M.
This thesis offers two logic-based approaches to conjunctive queries in the context of information extraction. The first and main approach is the introduction of conjunctive query fragments of the logics FC and FC[REG], denoted as FC-CQ and FC[REG]-C
Externí odkaz:
http://arxiv.org/abs/2208.01298
This paper investigates regex CQs with string equalities (SERCQs), a subclass of core spanners. As shown by Freydenberger, Kimelfeld, and Peterfreund (PODS 2018), these queries are intractable, even if restricted to acyclic queries. This previous res
Externí odkaz:
http://arxiv.org/abs/2104.04758
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
The present paper investigates the dynamic complexity of document spanners, a formal framework for information extraction introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (JACM 2015). We first look at the class of regular spanners and prove tha
Externí odkaz:
http://arxiv.org/abs/1909.10869
The present paper investigates the dynamic complexity of document spanners, a formal framework for information extraction introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (JACM 2015). We first look at the class of regular spanners and prove tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9768d4a31345926da08051e6c505c32f