Abstract. We recently proposed a simple declarative language for specifying a wide range of counting and occurrence constraints. The language uses just two global primitives: the R...
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
— This work proposes a control algorithm to stabilize a circular formation of AUVs tracking a time-varying center. We also consider the problem of uniform distribution of all the...
Lara B. Arranz, Alexandre Seuret, Carlos Canudas d...
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...