◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Laboratoire d'Algorithmique, Complexité et Logique

8 papers here128 citations across 8
fields
  • cs.LO3
  • cs.FL2
  • cs.CC1
  • cs.CR1
  • math.LO1
ROR 05bdn0q71OpenAlex

affiliations via OpenAlex

output
20062011
most citedModel-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

77 citations

researchers with a paper here
  • Sergey Verlan2 profiles3 · h 22
  • Emmanuel Polonowski2 · h 6
  • Yurii Rogozhin2 profiles2 · h 18
  • Cătălin Dima1
  • Danièle Beauquier1 · h 1
  • Denis Richard1 · h 9
  • Ferucio Laurenţiu Ţiplea1
  • Frédéric Gauche1 · h 2
  • Ion Petre1
  • Marian Kogler1
  • M. Vsemirnov1 · h 11
  • P. Cégielski1 · h 8
collaborating institutions
  • Institute of Mathematics and Computer ScienceMD2 papers
  • Åbo Akademi UniversityFI1 paper
  • Département d'InformatiqueFR1 paper
Showing 2011Show all

1 paper · 1 filter

cs.LO2011★ 77 cited

Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

Catalin Dima, Ferucio Laurentiu Tiplea

We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This pr…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.