4401 search results - page 492 / 881 » Computing with Default Logic |
175
click to vote
TLCA
1995
Springer
15 years 10 months ago
1995
Springer
We introduce a simply-typed λ-calculus (λ→ exn ) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the ...
159
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
NBTI has been a major aging mechanism for advanced CMOS technology and PBTI is also looming as a big concern. This work first proposes a compact on-chip sensor design that tracks ...
200
click to vote
ASM
2010
ASM
15 years 9 months ago
2010
ASM
Abstract. Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments therefore depends direct...
205
click to vote
BIRTHDAY
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
177
click to vote
DLOG
2003
15 years 8 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...