11160 search results - page 395 / 2232 » Incompleteness in a General Setting |
170
click to vote
CCCG
2009
15 years 8 months ago
2009
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...
187
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
163
click to vote
APAL
2006
15 years 7 months ago
2006
We present a technique for destroying stationary subsets of P+ using partial square sequences. We combine this method with Gitik's poset for changing the cofinality of a cardi...
163
click to vote
ESA
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
171
click to vote
ESOP
1994
Springer
15 years 11 months ago
1994
Springer
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...