725 search results - page 4 / 145 » Descriptive Set Theory of Families of Small Sets |
CORR
2011
Springer
13 years 4 months ago
2011
Springer
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
JAIR
2008
13 years 9 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
FOCM
2010
13 years 8 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
DM
2007
13 years 9 months ago
2007
We construct families of three-dimensional linear codes that attain the Griesmer bound and give a probablistic construction of linear codes that are close to the Griesmer bound. Al...