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 "resource logics with a diminishing resource"):
  Abstract: Model-checking resource logics with production and consumption of resources is a computationally hard and often undecidable problem. We introduce a simple and realistic assumption that there is at least one diminishing resource, that is, a resource that cannot be produced and every action has a non-zero cost on this resource. An example of such resource is time. We show that, with this assumption, problems that are undecidable even for the underlying Alternating Time Temporal Logic, such as model-checking under imperfect information and perfect recall, become decidable for resource logics with a diminishing resource.

Includes members:
  Member "fixed dimensional energy games are in pseudo polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "games where you can play optimally with finite memory")
  Member "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reasoning about quality and fuzziness of strategic behaviours")
  Member "solving parity games on integer vectors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy mean payoff games")
  Member "alternating time temporal logic with finite memory strategies":
    also connected through other hyperedges:
      (none)
  Member "model checking coalitional games in shortage resource scenarios":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "technical report model checking for resource bounded atl with production and consumption of resources")
  Member "model checking atl under imperfect information and perfect recall semantics is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sat based atl satisfiability checking")
  Member "reachability games on extended vector addition systems with states":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy mean payoff games")

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)