1835 search results - page 159 / 367 » Classifying Description Logics |
127
click to vote
APAL
2007
15 years 4 months ago
2007
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
136
click to vote
TCS
2008
15 years 4 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
162
click to vote
EDCC
2006
Springer
15 years 8 months ago
2006
Springer
The importance of fault tolerance at the processor architecture level has been made increasingly important due to rapid advancements in the design and usage of high performance de...
139
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We treat tracking as a matching problem of detected keypoints between successive frames. The novelty of this paper is to learn classifier-based keypoint descriptions allowing to i...
127
click to vote
LOGCOM
2010
15 years 2 months ago
2010
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...