66 search results - page 11 / 14 » A Stochastic Interpretation of Propositional Dynamic Logic: ... |
CAV
1999
Springer
13 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
FOSSACS
2001
Springer
14 years 1 days ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
AIPS
2003
13 years 9 months ago
2003
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
AAAI
2008
13 years 10 months ago
2008
In this paper, we propose the use of a neuro-fuzzy strategy to develop a Web personalization framework for the dynamic suggestion of URLs retained interesting for the currently co...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...