Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs

TL;DR

This paper explores using syntax analysis methods, specifically Earley parsing, to improve query evaluation in logic programming by generating automata that can be compiled for faster runtime performance.

Contribution

It introduces a novel approach combining Earley parsing with partial deduction to create automata for logic query evaluation, aiming to enhance efficiency.

Findings

Automaton-based query evaluation can be compiled for faster execution.

The approach integrates syntax analysis techniques into logic programming.

Potential speedup in deductive database query processing.

Abstract

My research goal is to employ a parser generation algorithm based on the Earley parsing algorithm to the evaluation and compilation of queries to logic programs, especially to deductive databases. By means of partial deduction, from a query to a logic program a parameterized automaton is to be generated that models the evaluation of this query. This automaton can be compiled to executable code; thus we expect a speedup in runtime of query evaluation. An extended abstract/ full version of a paper accepted to be presented at the Doctoral Consortium of the 30th International Conference on Logic Programming (ICLP 2014), July 19-22, Vienna, Austria