Datalog LITE

DOI10.1145/504077.504079zbMath1365.68203OpenAlexW2008029457MaRDI QIDQ5738951

Erich Grädel, Helmut Veith, Georg Gottlob

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

zbMATH Keywords

verificationcomplexitydatabasestemporal logicsguarded logics

Mathematics Subject Classification ID

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

Related Items (9)

Extending Co-logic Programs for Branching-Time Model Checking ⋮ Unnamed Item ⋮ Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. ⋮ Positive Dedalus programs tolerate non-causality ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Datalog LITE ⋮ Evaluating Datalog via tree automata and cycluits ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas ⋮ Guarded fixed point logics and the monadic theory of countable trees.

This page was built for publication: Datalog LITE