Sciweavers

338 search results - page 35 / 68
» Locally checkable proofs
Sort
View
ICRA
2008
IEEE
105views Robotics» more  ICRA 2008»
14 years 3 months ago
A ladybug exploration strategy for distributed adaptive coverage control
— A control strategy inspired by the hunting tactics of ladybugs is presented to simultaneously achieve sensor coverage and exploration of an area with a group of networked robot...
Mac Schwager, Francesco Bullo, David Skelly, Danie...
FMCO
2004
Springer
157views Formal Methods» more  FMCO 2004»
14 years 2 months ago
MoMo: A Modal Logic for Reasoning About Mobility
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
Rocco De Nicola, Michele Loreti
RTA
1997
Springer
14 years 1 months ago
Proving Innermost Normalisation Automatically
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
Thomas Arts, Jürgen Giesl
FS
2006
105views more  FS 2006»
13 years 9 months ago
Financial equilibria in the semimartingale setting: Complete markets and markets with withdrawal constraints
We prove existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria span complete...
Gordan Zitkovic
SLOGICA
2008
77views more  SLOGICA 2008»
13 years 9 months ago
Frame Based Formulas for Intermediate Logics
In this paper we define a new notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, s...
Nick Bezhanishvili