IDA - Intelligent Data Analysis Research Group

BibTeX Entry

  file = {sofsem-presentation.pdf},
  category = {ida-publications},
  author = {Filip {\v Z}elezn{\'y} and Ond{\v r}ej Ku{\v z}elka},
  title = {Taming the Complexity of Inductive Logic Programming (invited talk)},
  booktitle = {SOFSEM 2010: 36th International Conference on Current Trends in Theory and Practice of Computer Science},
  year = {2010},
  publisher = {Springer},
  abstract = {We review our recent research aimed at conquering two sources of complexity of inductive logic programming: the clause subsumption problem and the clause search problem.},
  vvvs = {0},
  obory = {JC, JD},
  zamer = {VZ-RR},

Creative Commons License  Content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Czech Republic License.