472 search results - page 22 / 95 » Limiting Negations in Formulas |
CAV
2004
Springer
14 years 3 months ago
2004
Springer
Bounded Model Checking, although complete in theory, has been thus far limited in practice to falsification of properties that were not invariants. In this paper we propose a term...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
JAPLL
2006
13 years 10 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
STACS
2007
Springer
14 years 4 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
DM
1999
13 years 10 months ago
1999
Pascal's rhombus is a variation of Pascal's triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the n...