3572 search results - page 502 / 715 » Nominal Logic Programming |
146
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
169
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
127
click to vote
SGAI
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
125
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
198
click to vote
IDA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...