25 search results - page 1 / 5 » The Power of Counting Logics on Restricted Classes of Finite... |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
LICS
1999
IEEE
13 years 9 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...