Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approac...
Stephan Frank, Petra Hofstedt, Peter Pepper, Dirk ...
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Constraints have played a central role in cp because they capture key substructures of a problem and efficiently exploit them to boost inference. This paper intends to do the same ...