Sciweavers

4737 search results - page 730 / 948
» The LOGIC negotiation model
Sort
View
MLQ
2007
90views more  MLQ 2007»
15 years 6 months ago
Kripke submodels and universal sentences
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
Ben Ellison, Jonathan Fleischmann, Dan McGinn, Wim...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
16 years 7 months ago
Extensible optimization in overlay dissemination trees
We introduce XPORT, a profile-driven distributed data dissemination system that supports an extensible set of data types, profile types, and optimization metrics. XPORT efficientl...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 7 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
PERCOM
2008
ACM
16 years 6 months ago
Provably Correct Pervasive Computing Environments
The field of pervasive computing has seen a lot of exciting innovations in the past few years. However, there are currently no mechanisms for describing the properties and capabil...
Anand Ranganathan, Roy H. Campbell
QEST
2008
IEEE
16 years 1 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...