| E. Hemaspaandra. The complexity of poor man's logic. In Symposium on TACS, volume 1770 of Lecture Notes in Computer Science, pages 230--242, 2000. |
....that rt w and not w rt. Let us de ne a family ( i ) i2N of PDL formulas encoding proposition letters. 1 : ha only true at 1 ha 0 iroot ha 0 iroot) i 1 : ha only true at i 1 :root :ha 0 iroot i ) Encodings of proposition letters can be also found in [27, 32], but our encoding is of a di erent nature since we tailor it to the spy point technique. The mapping f is now de ned as follows: f(p i ) i for i 1 11 p 1 M G rt 1 2 Figure 2: M and G: an example. f commutes with the Boolean connectives f(3 ) ha 0 i( 0 iroot :ha 0 iroot ....
E. Hemaspaandra. The complexity of poor man's logic. Journal of Logic and Computation, 11(4):609-622, 2001.
....( i ) i2N of PDL formulas encoding proposition letters. 1 : ha only true at 1 ha 0 iroot ha 0 iroot) 11 p 1 M G rt 1 2 Figure 2: M and G: an example. i 1 : ha only true at i 1 :root :ha 0 iroot i ) Encodings of proposition letters can be also found in [27, 32], but our encoding is of a different nature since we tailor it to the spy point technique. The mapping f is now f(p i ) i for i 1 f commutes with the Boolean connectives f(3 ) ha 0 i( 0 iroot :ha 0 iroot f( Now, let be a K formula. We will show that is globally ....
E. Hemaspaandra. The complexity of poor man's logic. Journal of Logic and Computation, 11(4):609--622, 2001.
No context found.
E. Hemaspaandra. The complexity of poor man's logic. In Symposium on TACS, volume 1770 of Lecture Notes in Computer Science, pages 230--242, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC