3738 search results - page 532 / 748 » Parametrized Logic Programming |
105
Voted
FOSSACS
2007
Springer
15 years 6 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...
115
click to vote
ICALP
2007
Springer
15 years 6 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...
96
Voted
SGAI
2007
Springer
15 years 6 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...
112
Voted
APLAS
2006
ACM
15 years 6 months ago
2006
ACM
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
101
Voted
SAC
2006
ACM
15 years 6 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 ...