84 search results - page 17 / 17 » Theme-Based Literate Programming |
STOC
1999
ACM
13 years 10 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
FOIKS
2006
Springer
13 years 10 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
ICAD
2004
13 years 7 months ago
2004
The following explains what mappings have been chosen for a sonification of several data channels from set containing a recording of the neural activity of a person listening to a...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...