This article is part of a project consisting in expressing, whenever possible, graph properties and graph transformations in monadic second-order logic or in its extensions using modulo p cardinality set predicates or auxiliary linear orders. A circle graph is the intersection graph of a set of chor
โฆ LIBER โฆ
Monadic Second Order Logic And Its Fragments
โ Scribed by Giacomo Lenzi
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 230 KB
- Volume
- 51
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
โฆ Synopsis
Various recent results about monadic second order logic and its fragments are presented. These results have been obtained in the framework of the EU TMR Project GETGRATS.
๐ SIMILAR VOLUMES
Circle graphs and monadic second-order l
โ
Bruno Courcelle
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 357 KB
The recursive sets in certain monadic se
โ
Siefkes, Dirk
๐
Article
๐
1975
๐
Springer-Verlag
โ 593 KB
Querying Linguistic Treebanks with Monad
โ
Stephan Kepser
๐
Article
๐
2004
๐
Springer Netherlands
๐
English
โ 117 KB
An existential fragment of second order
โ
Eric Rosen
๐
Article
๐
1999
๐
Springer
๐
English
โ 139 KB
A regular characterization of graph lang
โ
Joost Engelfriet
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 867 KB
A Comparison of Tree Transductions Defin
โ
Roderick Bloem; Joost Engelfriet
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 547 KB
Two well-known formalisms for the specification and computation of tree transductions are compared: the mso graph transducer and the attributed tree transducer with look-ahead, respectively. The mso graph transducer, restricted to trees, uses monadic second order logic to define the output tree in t