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

2014/05/15 by Heike Stephan, Stephan, Heike
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.AI

paper · pdf · doi:10.48550/arxiv.1405.3826

arxiv created 2014/05/15 · openalex publication_date 2014/05/15 · arxiv updated 2014/05/16 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

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

Related

• A Variant of Earley Deduction With Partial Evaluation
• Parsing and Generation with Tabulation and Compilation
• Principles and Implementation of Deductive Parsing
• Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
• A Backward Analysis for Constraint Logic Programs