Sciweavers

34 search results - page 7 / 7
» Weak Nonmonotonic Probabilistic Logics
Sort
View
STACS
2009
Springer
13 years 11 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
SIGMOD
1999
ACM
99views Database» more  SIGMOD 1999»
13 years 9 months ago
Belief Reasoning in MLS Deductive Databases
It is envisaged that the application of the multilevel security (MLS) scheme will enhance exibility and e ectiveness of authorization policies in shared enterprise databases and w...
Hasan M. Jamil
QEST
2008
IEEE
13 years 11 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 ...
NC
2008
122views Neural Networks» more  NC 2008»
13 years 4 months ago
Computation with finite stochastic chemical reaction networks
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
David Soloveichik, Matthew Cook, Erik Winfree, Jeh...