Constraint logic programming

Answer Set Programming with Constraints using Lazy Grounding

The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be …

Representing Multi-Agent Planning in CLP

We explore the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning domains in presence of multiple interacting agents. We develop a novel constraint-based action language, ℬ MAPthat enables the declarative …

Heuristics, Optimizations, and Parallelism for Protein Structure Prediction in CLP(FD)

The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices - a biologically meaningful approximation of the general protein folding problem. The paper improves the results presented in [15] and …