Bounded arity Datalog () queries on graphs
From MaRDI portal
Publication:1376404
DOI10.1006/JCSS.1997.1521zbMATH Open0889.68049OpenAlexW2002729873MaRDI QIDQ1376404FDOQ1376404
Authors: Foto N. Afrati
Publication date: 11 June 1998
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1997.1521
Recommendations
Cites Work
- The directed subgraph homeomorphism problem
- An observation on time-storage trade off
- Title not available (Why is that?)
- Datalog vs first-order logic
- Horn clause queries and generalizations
- On the equivalence of recursive and nonrecursive Datalog programs
- Undecidable optimization problems for database logic programs
- Bounds in the propagation of selection into logic programs
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Bounded arity Datalog \((\neq)\) queries on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376404)