780 search results - page 5 / 156 » Reasoning about sets using redescription mining |
IFIP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
NCA
2007
IEEE
13 years 8 months ago
2007
IEEE
Based on independent component analysis (ICA) and self-organizing maps (SOM), this paper proposes an ISOM-DH model for the incomplete data’s handling in data mining. Under these ...
HLPPP
1991
14 years 3 days ago
1991
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
KR
1992
Springer
14 years 19 days ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
IJCAI
1997
13 years 10 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...