Sciweavers

2920 search results - page 117 / 584
» Finite information logic
Sort
View
133
Voted
JCSS
2010
69views more  JCSS 2010»
15 years 3 months ago
On the formal semantics of IF-like logics
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in...
Santiago Figueira, Daniel Gorín, Rafael Gri...
168
Voted
PVLDB
2011
14 years 11 months ago
Implementing Performance Competitive Logical Recovery
New hardware platforms, e.g. cloud, multi-core, etc., have led to a reconsideration of database system architecture. Our Deuteronomy project separates transactional functionality ...
David B. Lomet, Kostas Tzoumas, Michael J. Zwillin...
SYNTHESE
2008
81views more  SYNTHESE 2008»
15 years 4 months ago
Adequate formalization
This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by d...
Michael Baumgartner, Timm Lampert
123
Voted
IPMU
2010
Springer
15 years 3 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
FOIKS
2006
Springer
15 years 8 months ago
Modeling the Evolution of Objects in Temporal Information Systems
This paper presents a semantic foundation of temporal conceptual models used to design temporal information systems. We consider a modeling language able to express both timestampi...
Alessandro Artale, Christine Parent, Stefano Spacc...