Constraint Logic Programming over Infinite Domains with an Application to Proof

Sebastian Krings, Michael Leuschel

We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An impo…