Draft:Theta-subsumption

Theta-subsumption (θ-subsumption) is an decidable relation between two first-order clauses that guarantees that one clause logically entails the other.

Definition

A clause $c_{1}$ θ-subsumes a clause $c_{2}$ if there is a substitution $\theta$ such that the clause obtained by applying $\theta$ to $c_{1}$ is a subset of $c_{2}$ .^[1]

Notes

^ De Raedt 2008, p. 127.

References

De Raedt, Luc (2008), Logical and Relational Learning, Berlin, Heidelberg: Springer, ISBN 978-3-540-20040-6

[FOOTNOTEDe_Raedt2008127-1] De Raedt 2008, p. 127.

[1]