Results 1  10
of
387,756
Deciding Weak Monadic Secondorder Logics
"... Abstract In this paper we propose to use techniques developed for query evaluation of Complexvalue Datalog queries for determining satisfiability of WS1S and WS2S formulae. This in turn can serve as a decision procedure for Description Logics for which embeddings into WS1S and WS2S have been propos ..."
Abstract
 Add to MetaCart
Abstract In this paper we propose to use techniques developed for query evaluation of Complexvalue Datalog queries for determining satisfiability of WS1S and WS2S formulae. This in turn can serve as a decision procedure for Description Logics for which embeddings into WS1S and WS2S have been
New Algorithm for Weak Monadic SecondOrder Logic on Inductive Structures
"... Abstract. We present a new algorithm for modelchecking weak monadic secondorder logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipulates formulas and checks them on the structure of interest, thus avoiding both the use of automata and the nee ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We present a new algorithm for modelchecking weak monadic secondorder logic on inductive structures, a class of structures of bounded clique width. Our algorithm directly manipulates formulas and checks them on the structure of interest, thus avoiding both the use of automata
Deciding weak monadic secondorder logics using complexvalue datalog
 In Proc. LPAR (Short Paper
, 2005
"... In this paper we propose to use techniques developed for query evaluation of Complexvalue Datalog queries for determining satisfiability of WS1S and WS2S formulæ. This in turn can serve as a decision procedure for Description Logics for which embeddings into WS1S and WS2S have been proposed recentl ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we propose to use techniques developed for query evaluation of Complexvalue Datalog queries for determining satisfiability of WS1S and WS2S formulæ. This in turn can serve as a decision procedure for Description Logics for which embeddings into WS1S and WS2S have been proposed
Deciding Weak Monadic Secondorder Logics using Complexvalue Datalog 6
"... Artificial Intelligence, ..."
On the Logical Hierarchy of Graphs
"... : Here is investigated the hierarchy of formulas defining graphs up to isomorphism in weak monadic second order logic. We give two proofs of the fact that this hierarchy is infinite, the first is based on the Ehrenfeucht Fraiss'e games and the second uses the arithmetical hierarchy. Finally we ..."
Abstract
 Add to MetaCart
: Here is investigated the hierarchy of formulas defining graphs up to isomorphism in weak monadic second order logic. We give two proofs of the fact that this hierarchy is infinite, the first is based on the Ehrenfeucht Fraiss'e games and the second uses the arithmetical hierarchy. Finally
Parikh Automata and Monadic SecondOrder Logics with Linear Cardinality Constraints
, 2002
"... We study extensions of weak monadic secondorder logics on words and trees with linear cardinality constraints of the form X_1 + ... + X_r < Y_1 + ... + Y_s; where the X_i s and Y_j s are monadic secondorder (MSO) variables. Although these logics are undecidable in general, we identify d ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We study extensions of weak monadic secondorder logics on words and trees with linear cardinality constraints of the form X_1 + ... + X_r < Y_1 + ... + Y_s; where the X_i s and Y_j s are monadic secondorder (MSO) variables. Although these logics are undecidable in general, we identify
Weak MSO+U over infinite trees ∗
"... We prove that, over infinite trees, satisfiability is decidable for Weak Monadic SecondOrder Logic extended by the unbounding quantifier U. We develop an automaton model, prove that it is effectively equivalent to the logic, and that the automaton model has decidable emptiness. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We prove that, over infinite trees, satisfiability is decidable for Weak Monadic SecondOrder Logic extended by the unbounding quantifier U. We develop an automaton model, prove that it is effectively equivalent to the logic, and that the automaton model has decidable emptiness.
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs
"... We provide several effective equivalent characterizations of EF (the modal logic of the descendant relation) on arbitrary trees. More specifically, we prove that, forEFbisimulation invariant properties of trees, being definable by an EF formula, being a Borel set, and being definable in weak monad ..."
Abstract
 Add to MetaCart
monadic second order logic, all coincide. The proof builds upon a known algebraic characterization of EF for the case of finitely branching trees due to Bojańczyk and Idziaszek. We furthermore obtain characterizations of modal logic on transitive Kripke structures as a fragment of weak monadic second
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 9 (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
URL: www.mimuw.edu.pl/∼bojan
, 2009
"... Abstract. 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 secondord ..."
Abstract
 Add to MetaCart
Abstract. 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
Results 1  10
of
387,756