Results 1 
5 of
5
Inflationary Fixed Points in Modal Logic
, 2002
"... We consider an extension of modal logic with an operator for constructing... ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
We consider an extension of modal logic with an operator for constructing...
Model Checking Games
, 2002
"... We survey evaluation games for firstorder logic and least fixed point logics, and discuss their algorithmic complexity. ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We survey evaluation games for firstorder logic and least fixed point logics, and discuss their algorithmic complexity.
Games and Model Checking for Guarded Logics
 IN PROCEEDINGS OF LPAR 2001, LECTURE NOTES IN COMPUTER SCIENCE NR. 2250
, 2000
"... We investigate the model checking problems for guarded firstorder and fixed point logics by reducing them to parity games. This approach is known to provide good results for the modal µcalculus and is very closely related to automatabased methods. To obtain good results also for guarded logics, o ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We investigate the model checking problems for guarded firstorder and fixed point logics by reducing them to parity games. This approach is known to provide good results for the modal µcalculus and is very closely related to automatabased methods. To obtain good results also for guarded logics, optimized constructions of games have to be provided. Further, we study the structure of parity games, isolate `easy' cases that admit efficient algorithmic solutions, and determine their relationship to specific fragments of guarded fixed point logics.
The Complexity of Computing the kary Composition of a Binary Associative Operator
, 1996
"... We show that the problem of computing all contiguous kary compositions of a sequence of n values under an associative and commutative operator requires 3 k\Gamma1 k+1 n \Gamma O(k) operations. For the operator max we show in contrast that in the decision tree model the complexity is i 1 + ..."
Abstract
 Add to MetaCart
We show that the problem of computing all contiguous kary compositions of a sequence of n values under an associative and commutative operator requires 3 k\Gamma1 k+1 n \Gamma O(k) operations. For the operator max we show in contrast that in the decision tree model the complexity is i 1 + \Theta(1= p k) j n \Gamma O(k). Finally we show that the complexity of the corresponding online problem for the operator max is i 2 \Gamma 1 k\Gamma1 j n \Gamma O(k). This work was partially supported by the ESPRIT Long Term Research Program of the EU under contract #20244 (ALCOMIT). y Supported by the Danish Natural Science Research Council (Grant No. 9400044). z Basic Research in Computer Science, Centre of the Danish National Research Foundation. 1 Introduction Given a sequence of values (x 1 ; x 2 ; : : : ; x n ) from a universe U and an associative binary operator \Phi, we consider the problem of computing all kary compositions of contiguous subsequences of length...
Cn(log 2 (n)).
, 1996
"... is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS ..."
Abstract
 Add to MetaCart
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS