Cut (logic programming)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The cut, in Prolog, is a goal, written as !, which always succeeds, but cannot be backtracked. It is best used to prevent unwanted backtracking, including the finding of extra solutions by Prolog and to avoid unnecessary computations.

The cut should be used sparingly. While cuts can be inserted into codes containing errors, if a test is unnecessary because a cut has guaranteed that it is true, it is good practice to say so in a comment at the appropriate place.[1]

Some programmers call the cut a controversial control facility [2] because it was added for efficiency reasons only and is not a Horn clause.


Green cut[edit]

A use of a cut which only improves efficiency is referred to as a green cut. Green cuts are used to make programs more efficient without changing program output. For example:

 gamble(X) :- gotmoney(X),!.
 gamble(X) :- gotcredit(X), \+ gotmoney(X).

This is called a green cut operator. The ! tells the interpreter to stop looking for alternatives; however, if gotmoney(X) fails it will check the second rule. Although checking for gotmoney(X) in the second rule may appear redundant since Prolog's appearance is dependent on gotmoney(X) failing before, otherwise the second rule would not be evaluated in the first place. Adding \+ gotmoney(X) guarantees that the second rule will always work, even if the first rule is removed by accident or changed, or moved after the second one.

Red cut[edit]

A cut that is not a green cut is referred to as a red cut, for example:

 gamble(X) :- gotmoney(X),!.
 gamble(X) :- gotcredit(X).

Proper placement of the cut operator and the order of the rules is required to determine their logical meaning. If for any reason the first rule is removed (e.g. by a cut-and-paste accident) or moved after the second one, the second rule will be broken, i.e., it will not guarantee the rule \+ gotmoney(X).


  1. ^ Dyckhoff, Roy (1994-05-20). Extensions of Logic Programming: 4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1, 1993. Proceedings. Springer Science & Business Media. ISBN 978-3-540-58025-6.
  2. ^ Foundations of Logic Programming, Springer (2012).