393 search results - page 55 / 79 » Probabilistic Description Logic Programs |
95
Voted
FPGA
2005
ACM
15 years 6 months ago
2005
ACM
We present an automatic logic synthesis method targeted for highperformance asynchronous FPGA (AFPGA) architectures. Our method transforms sequential programs as well as high-leve...
100
click to vote
TCS
2002
15 years 6 days ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
129
click to vote
FOIKS
2006
Springer
15 years 4 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...
106
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
117
click to vote
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...