884 search results - page 151 / 177 » A Proof Theory for DL-Lite |
102
click to vote
CORR
2011
Springer
14 years 6 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...
102
click to vote
JCST
2010
14 years 6 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
109
click to vote
JCT
2010
14 years 6 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
SIAMNUM
2010
14 years 6 months ago
2010
A number of works concerning rigorous convergence theory for adaptive finite element methods (AFEM) for controlling global energy errors have appeared in recent years. However, man...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...