An Evaluation Algorithm for Datalog with Equality

02/11/2023
by   Martin E. Bidlingmaier, et al.
0

We describe an evaluation algorithm for relational Horn logic (RHL). RHL extends Datalog with quantification over sorts, existential quantification in conclusions and, crucially, the ability to infer equalities. These capabilities allow RHL evaluation to subsume and expand applications of Datalog and congruence closure algorithms. We explain how aspects of a fast congruence closure algorithm can be incorporated into Datalog evaluation to obtain an efficient RHL evaluation algorithm. We then sketch how Steensgaard's points-to analysis and type inference can be implemented using RHL evaluation. RHL and the evaluation algorithm described here are the foundation of the Eqlog Datalog engine.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2002

Another perspective on Default Reasoning

The lexicographic closure of any given finite set D of normal defaults i...
research
09/07/2022

Small Proofs from Congruence Closure

Satisfiability Modulo Theory (SMT) solvers and equality saturation engin...
research
01/18/2018

Reasoning about multiple aspects in DLs: Semantics and Closure Construction

Starting from the observation that rational closure has the undesirable ...
research
11/12/2021

Regular Path Query Evaluation Sharing a Reduced Transitive Closure Based on Graph Reduction

Regular path queries (RPQs) find pairs of vertices of paths satisfying g...
research
01/28/2021

On computable aspects of algebraic and definable closure

We investigate the computability of algebraic closure and definable clos...
research
04/07/2020

egg: Easy, Efficient, and Extensible E-graphs

An E-graph is a data structure that can efficiently encode the congruenc...

Please sign up or login with your details

Forgot password? Click here to reset