The University of Edinburgh and research sponsors are authorised to reproduce and distribute reprints and on-line copies for their purposes notwithstanding any copyright annotation hereon. The views and conclusions contained herein are the authorâ s and shouldnâ t be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of other parties.Tackling real-world problems often requires to take various types of constraints into account. Such constraint types range from simple numerical comparators to complex resources. This article describes how planning techniques can be integrated with general constraint-solving frameworks, like SAT, IP and CP. In many cases, the complete
planning problem can be cast in these frameworks
