The parallel complexity of simple logic programs
From MaRDI portal
Publication:4271089
DOI10.1145/153724.153752zbMath0783.68051OpenAlexW2044831893MaRDI QIDQ4271089
Foto N. Afrati, Christos H. Papadimitriou
Publication date: 1993
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/153724.153752
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Linearisability on Datalog programs ⋮ Modular materialisation of Datalog programs ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ On the complexity of single-rule datalog queries. ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Inherent complexity of recursive queries
This page was built for publication: The parallel complexity of simple logic programs
