human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "strategic abilities of asynchronous agents semantic paradoxes and how to tame them"):
  Abstract: Recently, we proposed a framework for verification of agents' abilities in asynchronous multi-agent systems, together with an algorithm for automated reduction of models. The semantics was built on the modeling tradition of distributed systems. As we show here, this can sometimes lead to paradoxical interpretation of formulas when reasoning about the outcome of strategies. First, the semantics disregards finite paths, and thus yields counterintuitive evaluation of strategies with deadlocks. Secondly, the semantic representations do not allow to capture the asymmetry between active agents and the recipients of their choices. We propose how to avoid the problems by a suitable change of the semantics, and prove that the model reduction scheme still works in the modified framework.

Includes members:
  Member "mcmas slk a model checker for the verification of strategy logic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dealing with imperfect information in strategy logic")
  Member "model checking atl under imperfect information and perfect recall semantics is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sat based atl satisfiability checking")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.LO(Logic in Computer Science)