2035 search results - page 52 / 407 » On the complexity of stratified logics |
175
click to vote
TIME
2008
IEEE
16 years 15 days ago
2008
IEEE
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
150
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
158
click to vote
IJCNN
2008
IEEE
16 years 16 days ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
151
click to vote
ALIFE
2008
15 years 6 months ago
2008
, reproductive value, soft selectionAbstract Structural complexity characterizes our representations of dissipative structures. As a mechanistic concept, when referred to natural s...
175
click to vote
JCST
2010
15 years 28 days ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...