923 search results - page 112 / 185 » Proving the value of formal methods |
221
click to vote
KR
2010
Springer
15 years 8 months ago
2010
Springer
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
154
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
142
click to vote
JAPLL
2006
15 years 6 months ago
2006
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
156
click to vote
ENTCS
2007
15 years 6 months ago
2007
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
172
click to vote
SIAMCO
2011
14 years 9 months ago
2011
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di�...