2002, Brian Bagnall, Core Lego Mindstorms Programming, Most people, when they start programming their robot, will think of the program flow as a series of if–thens, which is reminiscent of structured programming (Figure 6–3).
2008, Selmer Bringsjord, The Cambridge Handbook of Computational Psychology Chapter Declarative/Logic-Based Cognitive Modeling, This rule says that if in a derivation you have an infinite list of if–thens (i.e., formulas of the form φ → ψ) where each consequent (ψ) in each if–then is an element of some infinite set Φ, then you can infer to an if–then whose consequent is the infinite conjunction obtained by conjoining all the elements of Φ.
2020, Game AI Pro 360: Guide to Architecture, Tests can be implemented by atomic actions that simply succeed or fail; if–thens can be implemented by composites like Selectors that execute the first nonfailing action, and blocks of code can be implemented by Sequences that execute all their nonfailing actions or Parallel nodes, which allow multiple actions to be executed concurrently (Champandard and Dunstan 2012).
