Datalog LITE
From MaRDI portal
Cited in
(13)- Guarded fixed point logics and the monadic theory of countable trees.
- A guarded fragment for abstract state machines
- 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
- scientific article; zbMATH DE number 7104937 (Why is no real title available?)
- FALKO
- STeLP
- Ltur
- NP Datalog
- Evaluating Datalog via tree automata and cycluits
- The semijoin algebra and the guarded fragment
- DatalogMTL
This page was built for software: Datalog LITE