Some Lower Bounds for the Computational Complexity of Inductive Logic Programming

Cite

Text

Kietz. "Some Lower Bounds for the Computational Complexity of Inductive Logic Programming." European Conference on Machine Learning, 1993. doi:10.1007/3-540-56602-3_131

Markdown

[Kietz. "Some Lower Bounds for the Computational Complexity of Inductive Logic Programming." European Conference on Machine Learning, 1993.](https://mlanthology.org/ecmlpkdd/1993/kietz1993ecml-some/) doi:10.1007/3-540-56602-3_131

BibTeX

@inproceedings{kietz1993ecml-some,
  title     = {{Some Lower Bounds for the Computational Complexity of Inductive Logic Programming}},
  author    = {Kietz, Jörg-Uwe},
  booktitle = {European Conference on Machine Learning},
  year      = {1993},
  pages     = {115-123},
  doi       = {10.1007/3-540-56602-3_131},
  url       = {https://mlanthology.org/ecmlpkdd/1993/kietz1993ecml-some/}
}