Conjunctive Queries for Logic-Based Information Extraction

TL;DR

This thesis introduces new logic-based methods for conjunctive queries in information extraction, focusing on specific logic fragments and their dynamic complexity, enhancing the theoretical foundation of the field.

Contribution

It presents novel conjunctive query fragments for FC and FC[REG] logics and analyzes their dynamic complexity, advancing the theoretical understanding of logic-based information extraction.

Findings

Defined conjunctive query fragments FC-CQ and FC[REG]-CQ

Analyzed the dynamic complexity of FC logic

Extended FC with regular constraints

Abstract

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.