Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
The Complexity of Satisfiability for Fragments of CTL and CTL*;
Electronic Notes in Theoretical Computer Science (ENTCS)
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Hi-index | 0.89 |