3408 search results - page 45 / 682 » Logic, language, information and computation |
188
click to vote
FOIKS
2006
Springer
15 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...
156
click to vote
ICFP
2000
ACM
15 years 10 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
192
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know...
141
click to vote
AUSAI
1999
Springer
15 years 10 months ago
1999
Springer
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, this reasoning service ca...
287
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...