Datalog LITE

DOI10.1145/504077.504079zbMATH Open1365.68203OpenAlexW2008029457MaRDI QIDQ5738951FDOQ5738951

Authors: Georg Gottlob, Erich Grädel, Helmut Veith 

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/504077.504079

Recommendations

• A linear algebraic approach to Datalog evaluation
• Linearisability on Datalog programs
• Querying datalog programs with temporal logic
• Publication:2767034
• Linear time Datalog and branching time logic
• Query processing in DOQL: A deductive database language for the ODMG model

zbMATH Keywords

verificationcomplexitydatabasestemporal logicsguarded logics

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (12)

• Guarded fixed point logics and the monadic theory of countable trees.
• A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic
• Efficient inclusion checking for deterministic tree automata and XML schemas
• Queries on XML streams with bounded delay and concurrency
• Positive Dedalus programs tolerate non-causality
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Datalog LITE
• On temporal logic versus Datalog
• Evaluating Datalog via tree automata and cycluits
• Extending co-logic programs for branching-time model checking

This page was built for publication: Datalog LITE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738951)