What is datalog? What can you do with datalog? Getting Started Path Reachability Python Naive Semi-Naive Indexing Lattice SQL recursive common table subexpressions Naive SQL translation Seminaive Lattices Ocaml Naive Rust Magic Set Program Analysis Evaluation Constant Propagation Symbolic Evaluation Reaching Definitions Liveness Points To Available Expressions Intersection Very Busy Expressions Zippers For Program Points Dominators Forall Emulation Doop Datalog Diassembly / Decompilers Bap Resources First Class Sets \& Reflection BitSets Bitset reflection Sort Lists Patricia Tries BDDs Call Meta circular interpreter BogoSort Translating functional programs Lists Dynamic Programming Q learning Mandelbrot Ball and Springs Sudoku Constraint handling Rules (CHR) Backprop Lambda representation Parsing Hilog Equality Saturation Term Rewriting Datalog Modulo Term Rewriting Graph rewriting Graph Algorithms Reachability Shortest Path Spanning Tree Clique Cycle Subgraph Matching Coloring Propagators Boolean Constraint Propagation Difference Logic Finite Domain Macros define ORBODY(h,b1,b2) CLAUSE(h, b1) CLAUSE(h, b2) define ORHEAD(h1,h2,b) CLAUSE(h1,b) CLAUSE(h2,b) define IMPLBODY(h, b1, b1) CLAUSE( h, (b1, b2) ) define IMPLHEAD() Emulating Prolog Need Sets Magic Set First class union find Translating Imperative Programs Iteration Model Checking Timestamping Theorem Proving Skolemization for Existential Heads Goals / Queries Uncurrying Contextual Datalog / Hypothetical Datalog Higher Order Clauses (Harrop) Stack database / Harrop Datalog / Tentative Datalog Existenial Queries Universal Quantifier Geometry Categorical Example Typeclass resolution Borrow Checker Type checking Coinductive or Greatest Fixed Point Datalog DFA Minimization CRDTs MultiSet Semantics Access Control Policies Networks Make Topics Answer Set Programmng Provenance Semi Naive Evaluation Algebraic Data Types Lattices Subsumption Subsumption as a master feature Provenance max min Recurusive Sum and Count Lattices Min/max lattice Maybe/Option lattice Intervals Widening Dyadic lattice Equivalence relations Negation Choice domain Semiring Semantics Probability Datalog+- and the chase Tabling Descriptive Complexity and Least Fixed Point Logic Push based Datalog Incremental / Differential Datalog Backtracking a Datalog Implementations Rel DDlog IncA Formulog Datafrog Ascent Flix dr lojekyl Datafun QL Souffle intrinsic functors floats Souffle proofs Aggregates User Defined Functors ADTs Contexts are King field accessors Vectors Use ADT instead of autoinc() Record Packing Macros Components Choice Domain Negation Souffle source EPR datalog Resources include prelude.ml class(slotname : f(x,y) , ) :- building souffle emscripten