Results 1  10
of
1,080,290
Asymptotic Monadic SecondOrder Logic
"... Abstract. In this paper we introduce socalled asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic SecondOrder Logic over infinite words. This is a logic talking about ωwords labelled ..."
Abstract
 Add to MetaCart
Abstract. In this paper we introduce socalled asymptotic logics, logics that are meant to reason about weights of elements in a model in a way inspired by topology. Our main subject of study is Asymptotic Monadic SecondOrder Logic over infinite words. This is a logic talking about ω
Quantitative monadic secondorder logic
 In Proceedings of LICS’13
, 2013
"... Abstract—While monadic secondorder logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to count. An automata model capable of computing such properties are weighted automata, but logics equivalent to these automata have o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—While monadic secondorder logic is a prominent logic for specifying languages of finite words, it lacks the power to compute quantitative properties, e.g. to count. An automata model capable of computing such properties are weighted automata, but logics equivalent to these automata have
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 148 (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
Monadic SecondOrder Logic with Arbitrary Monadic Predicates⋆
"... Abstract. We study Monadic SecondOrder Logic (MSO) over finite words, extended with (nonuniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automatatheoretic and machineindependent characterizations. We consider the regularity question: given a ..."
Abstract
 Add to MetaCart
Abstract. We study Monadic SecondOrder Logic (MSO) over finite words, extended with (nonuniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automatatheoretic and machineindependent characterizations. We consider the regularity question: given
Circle graphs and Monadic Secondorder logic
, 2005
"... A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique representation as a set of intersecting chords, and we prove that this representation can be defined by monadic secondorder ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
formulas. By using the (canonical) split decomposition of a circle graph, one can define in monadic secondorder logic all its chord representations formalized as words with two occurrences of each letter. This construction uses the general result that the split decomposition of a graph can be constructed
Lower Bounds for the Complexity of Monadic SecondOrder Logic
"... Abstract—Courcelle’s famous theorem from 1990 states that any property of graphs definable in monadic secondorder logic (MSO2) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO2 is fixedparameter tractable in linear time on any such class of graphs. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract—Courcelle’s famous theorem from 1990 states that any property of graphs definable in monadic secondorder logic (MSO2) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO2 is fixedparameter tractable in linear time on any such class of graphs
On the Parameterised Intractability of Monadic SecondOrder Logic
"... Abstract. One of Courcelle’s celebrated results states that if C is a class of graphs of bounded treewidth, then modelchecking for monadic second order logic (MSO2) is fixedparameter tractable (fpt) on C by linear time parameterised algorithms. An immediate question is whether this is best possib ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Abstract. One of Courcelle’s celebrated results states that if C is a class of graphs of bounded treewidth, then modelchecking for monadic second order logic (MSO2) is fixedparameter tractable (fpt) on C by linear time parameterised algorithms. An immediate question is whether this is best
Abstract Argumentation via Monadic Second Order Logic
, 2012
"... We propose the formalism of “Monadic SecondOrder Logic” as a unifying framework for representing and reasoning with various semantics of abstract argumentation. We express a wide range of semantics within the proposed framework, including the semantics proposed by Dung, semistable, stage, cf2, and ..."
Abstract
 Add to MetaCart
We propose the formalism of “Monadic SecondOrder Logic” as a unifying framework for representing and reasoning with various semantics of abstract argumentation. We express a wide range of semantics within the proposed framework, including the semantics proposed by Dung, semistable, stage, cf2
Safety for bisimulation in monadic secondorder logic
 Dept. of Philosophy, Utrecht University
, 1996
"... We characterize those formulas of MSO (monadic secondorder logic) that are safe for bisimulation: formulas de ning binary relations such that any bisimulation is also a bisimulation with respect to these de ned relations. Every such formula is equivalent to one constructed fromcalculus tests, atom ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We characterize those formulas of MSO (monadic secondorder logic) that are safe for bisimulation: formulas de ning binary relations such that any bisimulation is also a bisimulation with respect to these de ned relations. Every such formula is equivalent to one constructed fromcalculus tests
ITERATION WITH FRAGMENTS OF MONADIC SECOND ORDER LOGIC
"... Abstract. We investigate the relation between the theory of the iterations in the sense of ShelahStupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set quantification in monadic second order logic to certain subset ..."
Abstract
 Add to MetaCart
Abstract. We investigate the relation between the theory of the iterations in the sense of ShelahStupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set quantification in monadic second order logic to certain
Results 1  10
of
1,080,290