In this paper we describe a sound and complete concurrent operational semantics for constraint functional logic programming languages which allows to model declarative applications in which the interaction between demand-driven narrowing and constraint solving helps to prune the search space, leading to shorter goal derivations. We encode concurrency into the generic CFLP(D) scheme, a uniform f...

This paper presents new techniques for filtering boxes in the presence of an additional quadratic constraint, a problem relevant for branch and bound methods for global optimization and constraint satisfaction. This is done by generating powerful linear and parabolic relaxations from a quadratic constraint and bound constraints, which are then subject to standard constraint propagation techniqu...

5 This paper studies stability of error bounds for convex constraint systems 6 in Banach spaces. We show that certain known sufficient conditions for local 7 and global error bounds actually ensure error bounds for the family of func8 tions being in a sense small perturbations of the given one. A single inequality 9 as well as semi-infinite constraint systems are considered. 10 Mathematics Subj...

It is shown that the so-called \pure" mixed H 2 =H 1 optimization problem does not have a \good" solution. More precisely, a class of non-singular \pure" mixed H 2 =H 1 optimization problems (minimization of an L 2-norm subject to a Youla parameterization and an L 1 constraint) is considered. It is shown that, whenever the L 1 constraint is not redundant, the optimal controller has innnite orde...

We study in this paper some numerical schemes for hyperbolic systems with unilateral constraint. In particular, we deal with the scalar case, the isentropic gas dynamics system and the fullgas dynamics system. We prove the convergence of the scheme to an entropy solution of the isentropic gas dynamics with unilateral constraint on the density and mass loss. We also study the non-trivial steady ...

We adapt the TreeRePair tree compression algorithm and use it as an intermediate step in proving termination of term rewriting systems. We introduce a cost function that approximates the size of constraint systems that specify compatibility of matrix interpretations. We show how to integrate the compression algorithm with the Dependency Pairs transformation. Experiments show that compression re...

The dark energy cosmology with the equation of state w = constant is considered in this paper. The ΩDE−ΩM plane has been used to study the present state and expansion history of the universe. Through the mathematical analysis, we give the theoretical constraint of cosmological parameters. Together with some observations such as the transition redshift from deceleration to acceleration, more pre...

The most famous open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar’s constraint qualification holds. In this paper, we prove the maximal monotonicity of A+B provided that A,B are maximally monotone and A is a linear relation, as soon as Rockafellar’s constraint qualification holds: domA ∩ int domB 6...

Representing and solving constraint satisfaction problems is one of the challenges of artificial intelligence. In this paper, we present answer set programming (ASP) models for an important and very general class of constraints, including all constraints specified via grammars or automata that recognise some formal language. We argue that our techniques are effective and efficient, e.g., unit-p...

Statistical physics models with hard constraints, such as the discrete hardcore gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for the study of phase transition. In this paper we survey recent work (concentrating on joint work of the authors) in which hard-constraint systems are modeled by...