loading...
Two-way unary temporal logic over trees
Wroclaw, Poland July 10-July 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2007.5122nd Annual IEEE Symposium on Logic i ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Mikolaj Bojanczyk, "Two-way unary temporal logic over trees," Logic in Computer Science, Symposium on, pp. 121-130, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2007.51,
author = {Mikolaj Bojanczyk},
title = {Two-way unary temporal logic over trees},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2007},
issn = {1043-6871},
pages = {121-130},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2007.51},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Two-way unary temporal logic over trees
SN - 1043-6871
SP121
EP130
A1 - Mikolaj Bojanczyk,
PY - 2007
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Mikolaj Bojanczyk, Warsaw University
We consider a temporal logic EF + F^-1 for unranked, unordered finite trees. The logic has two operators: EF_\varphi , which says "in some proper descendant \varphi holds", and F^-1 \varphi , which says "in some proper ancestor \varphi holds". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF + F^-1. The algorithm uses a characterization expressed in terms of forest algebras.
Citation:
Mikolaj Bojanczyk, "Two-way unary temporal logic over trees," lics, pp.121-130, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.