Sciweavers

796 search results - page 77 / 160
» A Formalization of ODMG Queries
Sort
View
101
Voted
DAM
2008
125views more  DAM 2008»
15 years 28 days ago
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...
Eric SanJuan
92
Voted
IPMU
2010
Springer
14 years 11 months ago
Keeping Secrets in Possibilistic Knowledge Bases with Necessity-Valued Privacy Policies
Controlled Query Evaluation (CQE) is a logical framework for the protection of secrets in databases. In this article, we extend the CQE framework to possibilistic logic: knowledge ...
Lena Wiese
107
Voted
ICLP
1997
Springer
15 years 5 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
VLDB
2007
ACM
116views Database» more  VLDB 2007»
16 years 1 months ago
On the Correctness Criteria of Fine-Grained Access Control in Relational Databases
Databases are increasingly being used to store information covered by heterogeneous policies, which require support for access control with great flexibility. This has led to incr...
Qihua Wang, Ting Yu, Ninghui Li, Jorge Lobo, Elisa...
SEMWEB
2009
Springer
15 years 5 months ago
Reasoning With Provenance, Trust and all that other Meta Knowlege in OWL
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
Simon Schenk, Renata Queiroz Dividino, Steffen Sta...