Affiliation:
1. University of Wrocław, Wrocław, Poland
Abstract
We consider the two-variable logic with counting quantifiers (C
2
) interpreted over finite structures that contain two forests of ranked trees. This logic is strictly more expressive than standard C
2
and it is no longer a fragment of first-order logic. In particular, it can express that a structure is a ranked tree, a cycle, or a connected graph of bounded degree. It is also strictly more expressive than first-order logic with two variables and two successor relations of two finite linear orders. We present a decision procedure for the satisfiability problem for this logic. The procedure runs in NE
xp
T
ime
, which is optimal since the satisfiability problem for plain C
2
is NE
xp
T
ime
-complete.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference33 articles.
1. Complexity of Two-Variable Logic on Finite Trees
2. Two-variable logic on data trees and XML reasoning
3. Mikolaj Bojańczyk Anca Muscholl Thomas Schwentick Luc Segoufin and Claire David. 2006. Two-variable logic on words with data. In LICS. IEEE Computer Society 7--16. 10.1109/LICS.2006.51 Mikolaj Bojańczyk Anca Muscholl Thomas Schwentick Luc Segoufin and Claire David. 2006. Two-variable logic on words with data. In LICS. IEEE Computer Society 7--16. 10.1109/LICS.2006.51
4. Bounded Model Checking of Pointer Programs
5. Lecture Notes in Computer Science, Christian G;Charatonik Witold
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献