4940 search results - page 539 / 988 » On the Complexity of Universal Programs |
159
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
187
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. By developing an intelligent computer system that will provide commentary of chess moves in a comprehensible, user-friendly and instructive way, we are trying to use the ...
181
click to vote
ECOOP
2008
Springer
15 years 8 months ago
2008
Springer
Wildcards are a complex and subtle part of the Java type system, present since version 5.0. Although there have been various formalisations and partial type soundness results conce...
198
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
189
click to vote
EUC
2008
Springer
15 years 8 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...