600 search results - page 92 / 120 » An Extended Interpreted System Model for Epistemic Logics |
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
100
click to vote
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...
WOLLIC
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
VLDB
1990
ACM
15 years 2 months ago
1990
ACM
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...