메뉴 건너뛰기




Volumn , Issue , 2002, Pages 393-402

Decidable and undecidable fragments of first-order branching temporal logics

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; SEMANTICS; TREES (MATHEMATICS);

EID: 0036044780     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2002.1029847     Document Type: Article
Times cited : (56)

References (32)
  • 3
    • 0003359740 scopus 로고
    • The undecidability of the domino problem
    • Amer. Math. Soc., Providence, RI
    • (1966) Memoirs , vol.66
    • Berger, R.1
  • 19
    • 84937399243 scopus 로고    scopus 로고
    • Monodic fragments of first-order temporal logics: 2000-2001 A.D.
    • R. Nieuwenhuis and A. Voronkov, editors, Logic for Programming, Artificial Intelligence and Reasoning, Springer
    • (2001) LNAI , vol.2250 , pp. 1-23
    • Hodkinson, I.1    Wolter, F.2    Zakharyaschev, M.3
  • 22
    • 0005484470 scopus 로고    scopus 로고
    • A tableau-calculus for first-order branching time logic
    • D. Gabbay and H. J. Ohlbach, editors, International Conference on Formal and Applied Practical Reasoning (FAPR), Springer
    • (1996) LNCS , vol.1085 , pp. 399-413
    • May, W.1    Schmidt, P.2
  • 32
    • 0030553582 scopus 로고    scopus 로고
    • Branching-time logic with quantification over branches: The point of view of modal logic
    • (1996) J. Symbolic Logic , vol.61 , pp. 1-39
    • Zanardo, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.