86 search results - page 12 / 18 » Classical BI: Its Semantics and Proof Theory |
PODS
2010
ACM
14 years 20 days ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
CCS
2005
ACM
14 years 1 months ago
2005
ACM
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
ICIP
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents a Bayesian Network model for ContentBased Image Retrieval (CBIR). In the explanation and test of this work, only two images features (semantic evidences) are i...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...