DeepAI AI Chat
Log In Sign Up

Algebraic Semantics of Datalog with Equality

by   Martin E. Bidlingmaier, et al.

We discuss the syntax and semantics of relational Horn logic (RHL) and partial Horn logic (PHL). RHL is an extension of the Datalog programming language that allows introducing and equating variables in conclusions. PHL is a syntactic extension of RHL by partial functions and one of the many equivalent notions of essentially algebraic theory. Our main contribution is a new construction of free models. We associate to RHL and PHL sequents classifying morphisms, which enable us to characterize logical satisfaction using lifting properties. We then obtain free and weakly free models using the small object argument. The small object argument can be understood as an abstract generalization of Datalog evaluation. It underpins the implementation of the Eqlog Datalog engine, which computes free models of PHL theories.


page 1

page 2

page 3

page 4


Functorial Semantics for Partial Theories

We provide a Lawvere-style definition for partial theories, extending th...

Free Commutative Monoids in Homotopy Type Theory

We develop a constructive theory of finite multisets, defining them as f...

Cubical Syntax for Reflection-Free Extensional Equality

We contribute XTT, a cubical reconstruction of Observational Type Theory...

On the Semantics of Intensionality and Intensional Recursion

Intensionality is a phenomenon that occurs in logic and computation. In ...

Free algebras of topologically enriched multi-sorted equational theories

Classical multi-sorted equational theories and their free algebras have ...

Montague Semantics for Lambek Pregroups

Lambek pregroups are algebraic structures modelling natural language syn...

Frex: dependently-typed algebraic simplification

We present an extensible, mathematically-structured algebraic simplifica...