Talk:Theta-subsumption

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Ideas for extension

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

^ Butler, Ralph M. (May 1985). An algorithm for parallel subsumption (PhD thesis). University of Missouri-Rolla.
^ Kietz & Lübbe 1994
^ 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.
^ 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)
^ Kuželka, Ondřej; Železný, Filip (January 2008). "A Restarted Strategy for Efficient Subsumption Testing". Fundamenta Informaticae. 89 (1): 95–109.
^ 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.

[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.

[1]

[2]

[3]

[4]

[5]

[6]