We propose a simple and efficient modification of the popular DBSCAN clustering algorithm. This modification is able to detect the most interesting vertical threshold level in a...
—The danger of production or backup data becoming corrupted is a problem that database administrators dread. This position paper aims to bring this problem to the attention of th...
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continu...
Let κ < λ be regular uncountable cardinals. Using a finite support iteration of ccc posets we obtain the consistency of b = a = κ < s = λ. If µ is a measurable cardinal...
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...
: This paper proposes a constraint programming based approach to handle ontologies consistency, and more precisely user-defined consistencies. In practice, ontologies consistency i...
The paper discusses a new approach to merging conflicting propositional knowledge bases which builds on the idea that consistency can often be restored by interpreting proposition...
: Static analysis techniques for consistency checking of workflows allow to avoid runtime errors. This is in particular crucial for long running workflows where errors, detected la...
Gabriele Weiler, Arnd Poetzsch-Heffter, Stephan Ki...
Abstract. Most of the emphasis on mining online assessment logs has been to identify contentspecific errors. However, the pattern of general "consistency" is domain indep...