150 search results - page 12 / 30 » Counting Results in Weak Formalisms |
AIPS
2008
13 years 11 months ago
2008
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
HYBRID
2007
Springer
14 years 20 days ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
RTA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. The paper proposes a logical systematization of the notion of countsas which is grounded on a very simple intuition about what counts-as statements actually mean, i.e., f...
ENTCS
2002
13 years 8 months ago
2002
The MaC system has been developed to provide assurance that a target program is running correctly with respect to formal requirements specification. This is achieved by monitoring...