Decision lists are a representation for Boolean functions. Single term decision lists are more expressive than disjunctions and conjunctions; however, 1-term decision lists are less expressive than the general disjunctive normal form and the conjunctive normal form.
The language specified by a k-length decision list includes as a subset the language specified by a k-depth decision tree.
Learning decision lists can be used for attribute efficient learning.
Definition
A decision list (DL) of length r is of the form:
if f1 then output b1else if f2 then output b2...else if fr then output brwhere fi is the ith formula and bi is the ith boolean for