106 search results - page 7 / 22 » A logic you can count on |
CSR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
NC
2008
14 years 9 months ago
2008
A highly desired part of the synthetic biology toolbox is an embedded chemical microcontroller, capable of autonomously following a logic program specified by a set of instructions...
TGC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Ghost variables are assignable variables that appear in program annotations but do not correspond to physical entities. They are used to facilitate specification and ver...
90
Voted
LICS
2010
IEEE
14 years 7 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
DAGSTUHL
2007
14 years 11 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...