Conjunctive Queries for Logic-Based Information Extraction

08/02/2022
by   Sam M. Thompson, et al.
0

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]-CQ respectively. FC is a first-order logic based on word equations, where the semantics are defined by limiting the universe to the factors of some finite input word. FC[REG] is FC extended with regular constraints. The second approach is to consider the dynamic complexity of FC.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2022

First-order logic with self-reference

We consider an extension of first-order logic with a recursion operator ...
research
05/23/2018

Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints

In this work, we consider the satisfiability problem in a logic that com...
research
05/30/2019

Data Complexity and Rewritability of Ontology-Mediated Queries in Metric Temporal Logic under the Event-Based Semantics (Full Version)

We investigate the data complexity of answering queries mediated by metr...
research
07/02/2019

Logics for Reversible Regular Languages and Semigroups with Involution

We present MSO and FO logics with predicates `between' and `neighbour' t...
research
04/05/2020

Natural language processing for word sense disambiguation and information extraction

This research work deals with Natural Language Processing (NLP) and extr...
research
12/12/2019

Finite models and the theory of concatenation

We propose FC, a logic on words that combines the previous approaches of...
research
04/10/2021

Splitting Spanner Atoms: A Tool for Acyclic Core Spanners

This paper investigates regex CQs with string equalities (SERCQs), a sub...

Please sign up or login with your details

Forgot password? Click here to reset