Results 1 to 10 of about 259 (156)
On the Parameterized Intractability of Monadic Second-Order Logic [PDF]
One of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO_2) is fixed-parameter tractable (fpt) on C by linear time parameterized algorithms, where the ...
Stephan Kreutzer
doaj +7 more sources
Weighted Automata and Monadic Second Order Logic [PDF]
Let S be a commutative semiring. M. Droste and P. Gastin have introduced in 2005 weighted monadic second order logic WMSOL with weights in S. They use a syntactic fragment RMSOL of WMSOL to characterize word functions (power series) recognizable by ...
Nadia Labai, Johann A. Makowsky
doaj +4 more sources
Monadic Monadic Second Order Logic
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for structures such as finite words, finite trees, infinite words, infinite trees, elements of the free group, etc ...
Bartek Klin, Bojanczyk Mikołaj
exaly +3 more sources
Defining peptides in ChEBI [PDF]
Modern biochemistry is producing vast amounts of chemical knowledge. Ontologies, such as the Chemical Entities of Biological Interest (ChEBI) ontology, can help organising this knowledge.
Simon Flügel +7 more
doaj +2 more sources
Monadic Second Order Logic with Measure and Category Quantifiers [PDF]
We investigate the extension of Monadic Second Order logic, interpreted over infinite words and trees, with generalized "for almost all" quantifiers interpreted using the notions of Baire category and Lebesgue measure.
Matteo Mio +2 more
doaj +7 more sources
Computability by monadic second-order logic
12 pages, 4 figures, to appear in Information Processing ...
Joost Engelfriet
exaly +5 more sources
Bisimulation invariant monadic-second order logic in the finite [PDF]
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the modal mu-calculus.
Felix Wolf
exaly +6 more sources
Circle graphs and monadic second-order logic
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bruno Courcelle
exaly +3 more sources
Axiomatizations and Computability of Weighted Monadic Second-Order Logic [PDF]
Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted formulas output are evaluated. Gastin and Monmege (2018) gave abstract semantics for a version of weighted monadic
Antonis Achilleos +1 more
exaly +3 more sources
The Firefighter problem with dynamic defence costs. [PDF]
The Firefighter Problem is a single-player game modelling the spread of a contagion (e.g. rumours, diseases) on a graph. The player's objective is to defend vertices to protect at least a given number.
Ethan Hunter, Jessica Enright
doaj +2 more sources

