Results 1  10
of
49,723
ORDERINVARIANT MSO IS STRONGER THAN COUNTING MSO IN THE FINITE
, 2008
"... We compare the expressiveness of two extensions of monadic secondorder logic (MSO) over the class of finite structures. The first, counting monadic secondorder logic (CMSO), extends MSO with firstorder modulocounting quantifiers, allowing the expression of queries like “the number of elements in ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
be translated into an equivalent orderinvariant MSO formula, the converse had not yet been settled. Courcelle showed that for restricted classes of structures both orderinvariant MSO and CMSO are equally expressive, but conjectured that, in general, orderinvariant MSO is stronger than CMSO. We affirm
www.stacsconf.org ORDERINVARIANT MSO IS STRONGER THAN COUNTING MSO IN THE FINITE
"... Abstract. We compare the expressiveness of two extensions of monadic secondorder logic (MSO) over the class of finite structures. The first, counting monadic secondorder logic (CMSO), extends MSO with firstorder modulocounting quantifiers, allowing the expression of queries like “the number of e ..."
Abstract
 Add to MetaCart
CMSO formula can be translated into an equivalent orderinvariant MSO formula, the converse had not yet been settled. Courcelle showed that for restricted classes of structures both orderinvariant MSO and CMSO are equally expressive, but conjectured that, in general, orderinvariant MSO is stronger
Separating Graph Logic from MSO
"... Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of Monadic Second Order Logic (MSO), with quantification over sets of edges. We show that the containment is proper by exhi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of Monadic Second Order Logic (MSO), with quantification over sets of edges. We show that the containment is proper
MSO Zero One Laws on Random Acyclic Graphs
, 1999
"... We use Ehrenfeuchttype games to prove that Monadic Second Order logic admits labelled and unlabelled zeroone laws for random free trees, generating the same complete almost sure theory. Our method will be to dissect random trees to get a picture of what almost all random free trees look like. ..."
Abstract
 Add to MetaCart
2 Some Logic 3 2.1 Monadic Second Order Logic . . . . . . . . . . . . . . . . . . . 4 2.1.1 Constructing MSO . . . . . . . . . . . . . . . . . . . . 4 2.1.2 MSO Bisimulation Games . . . . . . . . . . . . . . . . 5 2.2 Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2
Towards a characterization of orderinvariant queries over tame structures
 Proceedings of the 19th International Workshop on Computer Science Logic, volume 3634 of Lecture Notes in Computer Science
, 2005
"... Abstract. This work deals with the expressive power of logics on finite graphs with access to an additional “arbitrary ” linear order. The queries that can be expressed this way are the orderinvariant queries for the logic. For the standard logics used in computer science, such as firstorder logic ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
Abstract. This work deals with the expressive power of logics on finite graphs with access to an additional “arbitrary ” linear order. The queries that can be expressed this way are the orderinvariant queries for the logic. For the standard logics used in computer science, such as firstorder
Weak MSO with the unbounding Quantifier
"... A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ωregular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic secondorder logic ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ωregular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter automaton), and in terms of logic (weak monadic secondorder
Deciding XPath containment with MSO
, 2006
"... XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath fragment covers most of the language features used in practice. Specifically, we show how XPath queries can be translated ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
into equivalent formulas in monadic secondorder logic. Using this translation, we construct an optimized logical formulation of the containment problem, which is decided using tree automata. When the containment relation does not hold between two XPath expressions, a counterexample XML tree is generated. We
Bundle Adjustment  A Modern Synthesis
 VISION ALGORITHMS: THEORY AND PRACTICE, LNCS
, 2000
"... This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics c ..."
Abstract

Cited by 555 (12 self)
 Add to MetaCart
covered include: the choice of cost function and robustness; numerical optimization including sparse Newton methods, linearly convergent approximations, updating and recursive methods; gauge (datum) invariance; and quality control. The theory is developed for general robust cost functions rather than
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
backed coup deposed the reformist government of Col. Jacobo Arbenz Guzmán in 1954. Moderates of the political center. embattled but alive in E1 Salvador, have virtually disappeared in Guatemalajoining more than 30.000 victims of terror over the last tifteen vears. “The situation in Guatemala is much more
Results 1  10
of
49,723