111 search results - page 12 / 23 » Definability in Logic and Rough Set Theory |
JAPLL
2006
13 years 7 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
RSCTC
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
HEURISTICS
2006
13 years 7 months ago
2006
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
EUSFLAT
2001
13 years 8 months ago
2001
One of the biggest problems in computer vision systems, analyzing images having high uncertainty/vagueness degree, is the treatment of such uncertainty. This problem is even clear...