Jump to content

Talk:Theta-subsumption

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Ideas for extension

[edit]

The article could be extended by considering implementations and algorithms for theta-subsumption,[1][2][3][4][5][6] as well as extensions such as theta-subsumption modulo background knowledge or OI-subsumption. Felix QW (talk) 23:03, 26 November 2023 (UTC)[reply]

References

  1. ^ Butler, Ralph M. (May 1985). An algorithm for parallel subsumption (PhD thesis). University of Missouri-Rolla.
  2. ^ Kietz & Lübbe 1994
  3. ^ Maloberti, Jérôme; Sebag, Michèle (May 2004). "Fast Theta-Subsumption with Constraint Satisfaction Algorithms". Machine Learning. 55 (2): 137–174. doi:10.1023/b:mach.0000023150.80092.40. ISSN 0885-6125.
  4. ^ Santos, Jose; Muggleton, Stephen (2010). "Subsumer: A Prolog theta-subsumption engine". LIPIcs - Leibniz International Proceedings in Informatics. Marc Herbstritt: 10 pages. doi:10.4230/LIPICS.ICLP.2010.172.{{cite journal}}: CS1 maint: unflagged free DOI (link)
  5. ^ Kuželka, Ondřej; Železný, Filip (January 2008). "A Restarted Strategy for Efficient Subsumption Testing". Fundamenta Informaticae. 89 (1): 95–109.
  6. ^ Blockeel, Hendrik; Valevich, Svetlana (2017). A simple framework for theta-subsumption testing in Prolog. The 26th International Conference on Inductive Logic Programming , 2016/09/04 - 2016/09/06, London, UK. Vol. 1865. pp. 14–19.