Theta-subsumption
Summary
Theta-subsumption is a decidable relation between two first-order clauses that guarantees that one clause logically entails the other. It was first introduced by John Alan Robinson in 1965 and has become a fundamental notion in inductive logic programming. Deciding whether a given clause θ-subsumes another is an NP-complete problem.
Originally created by Felix QW
11/26/2023, 6:50:59 PM
Modified
9/15/2025, 12:43:02 PM
Recent revisions
cs1
[[Wikipedia:OABOT|Open access bot]]: url-access updated in citation with #oabot.
[[Wikipedia:OABOT|Open access bot]]: doi updated in citation with #oabot.
/* top */ DAB
Dating maintenance tags: {{Use shortened footnotes}}
Uses shortened footnotes.
/* Applications */ Avoid duplicate use of "fundamental"
Add alternative name.
Prevent citation bot from adding editor to monograph
Alter: date, pmc. Add: s2cid, isbn, bibcode, doi, series, authors 1-1. editors 1-1. Removed proxy/dead URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. Upgrade ISBN10 to 13. | [[:en:WP:UCB|Use this bot]]. [[:en:WP:DBUG|Report bugs]]. | Suggested by Headbomb | #UCB_toolbar
Fix wikitext
/* Applications */ Fix formatting
Add statement on theorem proving
Never mind, bolding seems appropriate after all.
/* Properties */ Maybe now?
/* Properties */ Remove superfluous formatting on visible anchor.
Add anchor for future redirect
spelling
Replace redirect with new article.
