Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allow...
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
We revisit the problem of revising probabilistic beliefs using uncertain evidence, and report results on four major issues relating to this problem: How to specify uncertain evide...
We propose a generalization of expected utility that we call generalized EU (GEU), where a deci sion maker's beliefs are represented by plausibil ity measures and the dec...