Sciweavers

3244 search results - page 462 / 649
» Extensions to Description Logics
Sort
View
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
16 years 4 days ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
SIGMOD
2010
ACM
227views Database» more  SIGMOD 2010»
15 years 11 months ago
SecureBlox: customizable secure distributed data processing
We present SecureBlox, a declarative system that unifies a distributed query processor with a security policy framework. SecureBlox decouples security concerns from system speci...
William R. Marczak, Shan Shan Huang, Martin Braven...
ESOP
2000
Springer
15 years 10 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
CORR
2011
Springer
185views Education» more  CORR 2011»
15 years 1 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic
ML
2011
ACM
308views Machine Learning» more  ML 2011»
15 years 1 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...