Bounded Arity Datalog (!=) Queries on Graphs

Foto N. Afrati. Bounded Arity Datalog (!=) Queries on Graphs. In Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota. pages 97-106, ACM Press, 1994. [doi]

@inproceedings{Afrati94:0,
  title = {Bounded Arity Datalog (!=) Queries on Graphs},
  author = {Foto N. Afrati},
  year = {1994},
  doi = {10.1145/182591.182603},
  url = {http://doi.acm.org/10.1145/182591.182603},
  tags = {graph query, graph-rewriting, rewriting, Datalog},
  researchr = {https://researchr.org/publication/Afrati94%3A0},
  cites = {0},
  citedby = {0},
  pages = {97-106},
  booktitle = {Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 24-26, 1994, Minneapolis, Minnesota},
  publisher = {ACM Press},
  isbn = {0-89791-642-5},
}