In this paper we present GRASPER, a graph constraint solver based on set constraints.
GRASPER is a constraint logic-based reasoning framework aiming to provide a powerful …

In an increasing number of domains such as bioinformatics, combinatorial graph problems
arise. We propose a novel way to solve these problems, mainly those that can be translated …

In this paper we propose a lazy constraint imposing mechanism for improving the path
constraint in GRASPER, a state-of-the-art graph constraint solver, having obtained very …

GRASPER Page 1 GRASPER (A Framework for Graph Constraint Satisfaction Problems)
Ruben Viegas⋆ and Francisco Azevedo CENTRIA, Departamento de Informática Universidade …

(eng) Constraint programming (CP) aims at modeling and solving constraint satisfaction
problems. These problems consist of a set of variables, each with a set of potential values …

Combinatorial problems can be efficiently tackled with constraint programming systems. The
main tasks of the development of a constraint-based application are modeling the problem …

Knowledge representation and reasoning (KR&R) is one of the foundations of Artificial
Intelligence (AI). In particular, the key role of KR&R for AI relies on the hypothesis that …

Many IT applications require solving decision problems that are hard from a mathematical
point of view. Constraint-programming enables to model and solve some of these problems …

In this chapter, I briefly present constraint reasoning. Constraint reasoning has been a
subfield of artificial intelligence (AI) that is nowadays more well-known as constraint …

A major challenge in constraint programming is to develop efficient generic approaches to
solve instances of the constraint satisfaction problem (CSP). With this aim in mind, this book …