One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds,...

We introduce a constraint system LC that handles arithmetic constraints over reals within the linear concurrent constraint programming (lcc) framework. This approach provides us with a general, ex-tensible foundation for linear programming algorithm design that comes with a (linear) logical semantics. In particular, it allows us to build a `glass-box' version of the (constraint solver) simplex ...

This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition, the basic operations of path-consistency algorithms. This establishes that path consistency over CRC constraints produces a minimal and decomposable network and is thus a polynomial-time decision procedure for CRC ne...

In this letter, we present an approach for learning a neural implicit signed distance function expressed in joint space coordinates, that efficiently computes distance-to-collisions arbitrary robotic manipulator configurations. Computing such distances is long standing problem robotics as approximate representations of the robot and environment geometry can lead to overly conservative constrain...

Computational phylogenetics has been shown to be effective over grammatical characteristics. Recent work suggests that constraintbased formalisms are compatible with such an approach (Eden, 2013). In this paper, we report on simulations to determine how useful constraint-based formalisms are in phylogenetic research and under what conditions.

The expected utility knapsack problem is to pick a set of items whose values are described by random variables so as to maximize the expected utility of the total value of the items picked while satisfying a constraint on the total weight of items picked. We consider the following solution approach for this problem: (i) use the sample average approximation framework to approximate the stochasti...

This paper describes a constraint-based invariant generation technique for proving the validity of safety assertions over the domain of predicate abstraction in an interprocedural setting. The key idea of the technique is to represent each invariant in bounded DNF form by means of boolean indicator variables, one for each predicate p and each disjunct d denoting whether p is present in d or not...

This paper considers the nonlinear disturbance decoupling problem for a robotic manipulator that is mounted on a mobile platform. A mobile manipulation system offers a dual advantage of mobility offered by a mobile platform and dexterity offered by the manipulator. In this work, the tracking and nonlinear disturbance decoupling problems are studied with particular focus on disturbances due to u...

Recent advances in laser technology, and especially essential increase of the cutting speed, motivate amendment of the existing robot path methods, which do not allow complete utilisation of the actuator capabilities and also neglect some particularities in the mechanical design of the manipulator arm wrist. This research addresses the optimisation of the 6-axes robot motions for the continuous...

We consider relational databases organized over an ordered domain with some additional relations|a typical example is the ordered domain of rational numbers together with the ternary relation + of addition. In the focus of our study are the rst order queries that are invariant under order-preserving \permutations"|such queries are called (order-)generic. We show that for an arbitrary ordered di...