319 search results - page 47 / 64 » Uncertainty Reasoning in Description Logics: A Generic Appro... |
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
IAT
2008
IEEE
13 years 9 months ago
2008
IEEE
As information and communication technologies are becoming an integral part of our homes, the demand for AmI systems with assistive functionality is increasing. A great effort has...
DLOG
2007
13 years 11 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
IJCAI
1993
13 years 10 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
IEAAIE
1998
Springer
14 years 29 days ago
1998
Springer
The users of libraries of object-oriented software components face with both a terminological and a cognitive gap. Usually, library users do not understand the vocabulary used in t...