300 search results - page 11 / 60 » An extension of the Cayley-Sylvester formula |
CAV
2010
Springer
13 years 11 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
ECSQARU
2009
Springer
14 years 15 days ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
ICSE
2004
IEEE-ACM
14 years 8 months ago
2004
IEEE-ACM
Our paper introduces a runtime verification framework for concurrent monitoring of applications specified by UML statecharts. The approach offers a considerable degree of granulari...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...