2 papers
cs.PL2005
Programming Finite-Domain Constraint Propagators in Action Rules
Neng-Fa Zhou
In this paper, we propose a new language, called AR ({\it Action Rules}), and describe how various propagators for finite-domain constraints can be implemented in it. An action rul…
cs.AI2000
Linear Tabulated Resolution Based on Prolog Control Strategy
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You +1
Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checki…