Deterministic FOIES are strictly weaker

DOI10.1023/A:1018951521198zbMath0880.68031OpenAlexW1507528661MaRDI QIDQ1370629

Guozhu Dong, Jianwen Su

Publication date: 26 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018951521198

zbMATH Keywords

a first-order incremental evaluation systemfoies

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (5)

Dynamic conjunctive queries ⋮ The dynamic descriptive complexity of \(k\)-clique ⋮ Incremental recomputation in local languages. ⋮ Arity bounds in first-order incremental evaluation and definition of polynomial time database queries ⋮ Maintenance of datalog materialisations revisited

This page was built for publication: Deterministic FOIES are strictly weaker