64 search results - page 9 / 13 » Rough Sets and 3-Valued Logics |
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we introduce the concept of valued tolerance as an extension of the usual concept of indiscernibility (which is a crisp equivalence relation) in rough sets theory. So...
RSCTC
1998
Springer
13 years 11 months ago
1998
Springer
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...