We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
In recent work, we have shown that morphological openings and closings can be viewed as consistent MAP estimators of morphologically smooth binary image signals immersed in i.i.d....
Nikolaos Sidiropoulos, John S. Baras, Carlos Alber...