The parallel complexity of single rule logic programs

DOI10.1016/0166-218X(92)90025-6zbMath0767.68011MaRDI QIDQ1202885

Foto N. Afrati

Publication date: 31 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

parallel complexitydatabase query languagedatalog programs\({\mathcal P}\) completeweak- chain rule programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Structure and complexity of relational queries
• Implementation of logical query languages for databases
• Horn clause queries and generalizations
• Relational queries computable in polynomial time
• On compiling queries in recursive first-order databases
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language

This page was built for publication: The parallel complexity of single rule logic programs