295 search results - page 51 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
PVLDB
2010
14 years 8 months ago
2010
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
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...
101
click to vote
JFP
2008
14 years 9 months ago
2008
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
POPL
2012
ACM
13 years 5 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
AAAI
2010
14 years 11 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...