Results 1  10
of
648
SCAN is complete for all Sahlqvist formulae
 In Relational and KleeneAlgebraic Methods in Computer Science (RelMiCS 7
, 2004
"... Abstract. SCAN is an algorithm for reducing monadic existential secondorder logic formulae to equivalent simpler formulae, often firstorder logic formulae. It is provably impossible for such a reduction to firstorder logic to be always successful, even if there is an equivalent firstorder formul ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
Abstract. SCAN is an algorithm for reducing monadic existential secondorder logic formulae to equivalent simpler formulae, often firstorder logic formulae. It is provably impossible for such a reduction to firstorder logic to be always successful, even if there is an equivalent firstorder
The monadic secondorder logic of graphs I. Recognizable sets of Finite Graphs
 Information and Computation
, 1990
"... The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins ..."
Abstract

Cited by 301 (17 self)
 Add to MetaCart
The notion of a recognizable sef offinite graphs is introduced. Every set of finite graphs, that is definable in monadic secondorder logic is recognizable, but not vice versa. The monadic secondorder theory of a contextfree set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins
TwoVariable Descriptions of Regularity
"... We prove that the class of all languages that are definable in \Sigma 1 1 (FO 2 ), that is, in (nonmonadic) existential secondorder logic with only two firstorder variables, coincides with the regular languages. This provides an alternative logical description of regularity to both the tradit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove that the class of all languages that are definable in \Sigma 1 1 (FO 2 ), that is, in (nonmonadic) existential secondorder logic with only two firstorder variables, coincides with the regular languages. This provides an alternative logical description of regularity to both
A Counterexample to the 01 Law for Existential Monadic SecondOrder Logic
 CLI Internal Note 32, Computational Logic Inc
, 1988
"... ndorder logic to my attention. Theorem 1. There is a sentence of existential monadic secondorder logic which has no limit probability. Theorem 2. For every rational number r in the interval [0,1] there is a sentence of existential monadic secondorder logic which has limit probability r. The main ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
ndorder logic to my attention. Theorem 1. There is a sentence of existential monadic secondorder logic which has no limit probability. Theorem 2. For every rational number r in the interval [0,1] there is a sentence of existential monadic secondorder logic which has limit probability r. The main
One Quantifier Will Do in Existential Monadic SecondOrder Logic over Pictures
, 1998
"... . We show that every formula of the existential fragment of monadic secondorder logic over picture models (i.e., finite, twodimensional, coloured grids) is equivalent to one with only one existential monadic quantifier. The corresponding claim is true for the class of word models ([Tho82]) but not ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. We show that every formula of the existential fragment of monadic secondorder logic over picture models (i.e., finite, twodimensional, coloured grids) is equivalent to one with only one existential monadic quantifier. The corresponding claim is true for the class of word models ([Tho82
Revisiting ConstraintDirected Search
"... Abstract We revisit the exploration of constraintdirected neighbourhoods, where a (small) set of constraints is picked before considering the neighbouring configurations where those constraints have a decreased (or preserved, or increased) penalty. Given the semantics of a constraint, such neighbou ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
, such neighbourhoods can be represented via new attributes or primitives for the corresponding constraint object. We show how to define these neighbourhoods for set constraints, whether builtin or specified in monadic existential secondorder logic. We also present an implementation of the corresponding primitives
Existential SecondOrder Logic over Strings
, 1998
"... Existential secondorder logic (ESO) and monadic secondorder logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over successor structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Existential secondorder logic (ESO) and monadic secondorder logic (MSO) have attracted much interest in logic and computer science. ESO is a much more expressive logic over successor structures than MSO. However, little was known about the relationship between MSO and syntactic fragments
MONA: Monadic SecondOrder Logic in Practice
 IN PRACTICE, IN TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, FIRST INTERNATIONAL WORKSHOP, TACAS '95, LNCS 1019
, 1995
"... The purpose of this article is to introduce Monadic Secondorder Logic as a practical means of specifying regularity. The logic is a highly succinct alternative to the use of regular expressions. We have built a tool MONA, which acts as a decision procedure and as a translator to finitestate au ..."
Abstract

Cited by 149 (20 self)
 Add to MetaCart
The purpose of this article is to introduce Monadic Secondorder Logic as a practical means of specifying regularity. The logic is a highly succinct alternative to the use of regular expressions. We have built a tool MONA, which acts as a decision procedure and as a translator to finite
Padding and the Expressive Power of Existential SecondOrder Logics
 Proceedings of the Annual Conference of the European Association for Computer Science Logic, Lecture Notes in Computer Science
, 1997
"... Padding techniques are wellknown from Computational Complexity Theory. Here, an analogous concept is considered in the context of existential secondorder logics. Informally, a graph H is a padded version of a graph G, if H consists of an isomorphic copy of G and some isolated vertices. A set A of ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Padding techniques are wellknown from Computational Complexity Theory. Here, an analogous concept is considered in the context of existential secondorder logics. Informally, a graph H is a padded version of a graph G, if H consists of an isomorphic copy of G and some isolated vertices. A set A
Ordering Constraints over Feature Trees Expressed in Secondorder Monadic Logic
 Information and Computation
, 1998
"... The language FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. While the firstorder theory of FT is well understood, only few decidability results are known for the firstorder theory of FT . We introduc ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
one can change the model towards sufficiently labeled feature trees  a class of trees that we introduce. As we show, the first ordertheory of ordering constraints over sufficiently labeled feature trees is equivalent to secondorder monadic logic (S2S for infinite and WS2S for finite feature
Results 1  10
of
648