522 search results - page 44 / 105 » Real-time Logics: Complexity and Expressiveness |
194
Voted
PLANX
2007
15 years 7 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
160
click to vote
ICCAD
2002
IEEE
15 years 11 months ago
2002
IEEE
The ultimate goal of logic synthesis is to explore implementation flexibility toward meeting design targets, such as area, power, and delay. Traditionally, such flexibility is exp...
169
click to vote
DLOG
2001
15 years 7 months ago
2001
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
188
click to vote
JMLR
2008
15 years 6 months ago
2008
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...