Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,044
Asymptotic Monadic Second-Order Logic
"... Abstract. In this paper we introduce so-called 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 Second-Order Logic over infinite words. This is a logic talking about ω-words labelled ..."
Abstract
- Add to MetaCart
Abstract. In this paper we introduce so-called 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 Second-Order Logic over infinite words. This is a logic talking about ω
Quantitative monadic second-order logic
- In Proceedings of LICS’13
, 2013
"... Abstract—While monadic second-order logic is a promi-nent 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 second-order logic is a promi-nent 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 Second-Order 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 Second-order 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-state au ..."
Abstract
-
Cited by 149 (20 self)
- Add to MetaCart
The purpose of this article is to introduce Monadic Second-order 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 Second-Order Logic with Arbitrary Monadic Predicates⋆
"... Abstract. We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent characterizations. We consider the regularity question: given a ..."
Abstract
- Add to MetaCart
Abstract. We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent characterizations. We consider the regularity question: given
Abstract Argumentation via Monadic Second Order Logic
, 2012
"... We propose the formalism of “Monadic Second-Order 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, semi-stable, stage, cf2, and ..."
Abstract
- Add to MetaCart
We propose the formalism of “Monadic Second-Order 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, semi-stable, stage, cf2
ITERATION WITH FRAGMENTS OF MONADIC SECOND ORDER LOGIC
"... Abstract. We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp 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 Shelah-Stupp 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
Monadic Second Order Logic on Tree-Like Structures
, 1996
"... An operation M* which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on such tree-like structures is defined. It is shown that automata of this kind characterise expressive power of ..."
Abstract
-
Cited by 26 (8 self)
- Add to MetaCart
of monadic second order logic (MSOL) over tree-like structures. Using this characterisation it is proved that MSOL theory of tree-like structures is effectively reducible to that of the original structures. As another application of the characterisation it is shown that MSOL on trees of arbitrary degree
Circle graphs and Monadic Second-order 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 second-order ..."
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 second-order 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
The monadic second-order 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 second-order logic is recognizable, but not vice versa. The monadic second-order theory of a context-free 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 second-order logic is recognizable, but not vice versa. The monadic second-order theory of a context-free set of graphs is decidable. 0 19W Academic Press. Inc. This paper begins
Lower Bounds for the Complexity of Monadic Second-Order Logic
"... Abstract—Courcelle’s famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of bounded tree-width, 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 second-order logic (MSO2) can be decided in linear time on any class of graphs of bounded tree-width, or in other words, MSO2 is fixedparameter tractable in linear time on any such class of graphs
Results 1 - 10
of
3,044
