Decision lists are a representation for Boolean functions which can be easily learnable from examples.[1] 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.[2]
A decision list (DL) of length is of the form:
if then output else if then output ... else if then output
where is the th formula and is the th boolean for
i\in\{1...r\}