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...
At the "functional level", Semantic Web Services (SWS) are described akin to planning operators, with preconditions and effects relative to an ontology; the ontology prov...
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Levin and Schnorr (independently) introduced the monotone complexity, Km(), of a binary string . We use monotone complexity to define the relative complexity (or relative randomnes...
It is commonly accepted that genes with similar expression profiles are functionally related. However, there are many ways one can measure the similarity of expression profiles, a...
Golan Yona, William Dirks, Shafquat Rahman, David ...