Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Theta-subsumption
open-in-new
<p> Theta-subsumption (θ-subsumption, or just subsumption) is a <a href="/facts/Decidability_(logic)/17SHPMo0">decidable</a> relation between two <a href="/facts/First-order_logic/lcISqWIg">first-order</a> <a href="/facts/Clause_(logic)/e3g5zV6n">clauses</a> that guarantees that one clause logically <a href="/facts/Entailment/AyDXp4dn">entails</a> the other. It was first introduced by <a href="/facts/John_Alan_Robinson/k2acEudn">John Alan Robinson</a> in 1965 and has become a fundamental notion in <a href="/facts/Inductive_logic_programming/gKc9Nxq4">inductive logic programming</a>. Deciding whether a given clause θ-subsumes another is an <a href="/facts/NP-completeness/NFPv56DU">NP-complete</a> problem. </p>