Wieslaw Szwast and Lidia Tendera. On the decision problem for the guarded fragment with transitivity. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS 2001, pages 147-- 156, Boston, Massachusetts, USA, 2001. IEEE Computer Society. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Deciding Regular Grammar Logics With Converse Through.. - Demri, de Nivelle (2003) (3 citations) (Correct)
....to capture some of the basic modal logics, various extensions of GF have been proposed and studied. In [GMV99] it has been shown that GF with transitivity axioms is decidable, on the condition that binary predicates occur only in guards. The complexity bound given there is non elementary. In [ST01], the complexity bound for GF with transitive guards is improved to 2EXPTIME and also shown NEXPTIME hard. Another fragment was explored in [GW99] see also [Gr a99a] There it has been shown that GF; the guarded fragment of rst order logic extended with a calculus style xed point ....
....language is more restricted. Moreover, we do not use MSO de nable built in relations, just plain GF . This has also advantages from the complexity point of view. Indeed, GF with transitive guards restricted to two variables is already EXPSPACE hard [Kie02] see also related results in [ST01]) Finally, our encoding of regular grammar logics into GF is also reminiscent to the propagation of formulae in tableau calculi [Gor99,Mas00,FdCG02] Structure of the paper Section 2 de nes the class of regular grammar logics with converse via semi Thue systems. It contains standard examples ....
W. Szwast and L. Tendera. On the decision problem for the guarded fragment with transitivity. In LICS'01, pages 147-156, 2001.
Modal Logics with Existential Modality, Finite-iteration.. - Shkatov (2005) (Correct)
No context found.
Wieslaw Szwast and Lidia Tendera. On the decision problem for the guarded fragment with transitivity. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS 2001, pages 147-- 156, Boston, Massachusetts, USA, 2001. IEEE Computer Society.
Complexity of Hybrid Logics over Transitive Frames - Mundhenk, Schneider.. (Correct)
No context found.
Szwast, W. and L. Tendera, On the decision problem for the guarded fragment with transitivity, in: LICS, 2001, pp. 147--156.
Representation Theorems and the Semantics of Non-Classical .. - Sofronie-Stokkermans (2002) (Correct)
No context found.
W. Szwast and L. Tendera. On the decision problem for the guarded fragment with transitivity. In Proceedings of the 16th IEEE Annual Symposium on Logic in Computer Science, pages 147-156. IEEE Computer Society, 2001.
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