2302 search results - page 271 / 461 » Basic Description Logics |
209
click to vote
AIML
2004
15 years 8 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
203
Voted
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
207
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
— Secure Semantic Web applications, particularly those involving access control, are typically focused at the application-domain only, rather than taking a more holistic approach...
179
click to vote
AIMSA
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. State of the art formalisms for distributed ontology integration provide ways to express semantic relations between concepts belonging to different ontologies. However, t...
157
Voted
ISVC
2007
Springer
16 years 1 months ago
2007
Springer
Video event understanding requires a formalism that can model complex logical temporal and spatial relations between composing sub-events. In this paper we argue that the Petri-Net...