In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...

Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...

We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers. Examples of such problems are feasibility of linear programs, integer linear programming, the max-atoms problem, Hilbert’s tenth problem, and many more. Our particular focus is to identify those CSPs that can be solved in polynomial time, an...

Many real-world planning problems require sophisticated reasoning about numeric resources, including sharing of resources by different actions. Constraintbased planners offer machinery to represent complex constraints and dependencies between actions. However, such planners usually consider a single partial plan at a time, and limit themselves with finding a feasible solution. Alternatively, pl...

Work Partner robot is a combination of a hybrid locomotion robot platform, and a special two hand manipulator mounted over the platform. A rigid body simulation model has been build of this whole system to help in development process. The robot platform, called Hybtor, and the manipulator has to work in collaboration. Kinematic simulation model of the platform has been used for visual study of ...