3552 search results - page 352 / 711 » Proof theory in the abstract |
192
click to vote
ARGMAS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents an argumentation mechanism for reconciling conflicts between planning agents related to plan proposals, which are caused by inconsistencies between b...
181
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
188
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) ...
207
click to vote
IFM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and ...
196
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...