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 "model checking and validity in propositional and modal inclusion logics"):
  Abstract: Modal inclusion logic is a formalism that belongs to the family of logics based on team semantics. This article investigates the model checking and validity problems of propositional and modal inclusion logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. Thereby we tie some loose ends related to the programme that ultimately aims to classify the complexities of the basic reasoning problems for modal and propositional dependence, independence, and inclusion logics.

Includes members:
  Member "team semantics for the specification and verification of hyperproperties":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "descriptive complexity of real computation and probabilistic independence logic")
  Member "validity and entailment in modal and propositional dependence logics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "axiomatizations of team logics")
  Member "axiomatizations of team logics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "internal calculi for separation logics")
  Member "the expressive power of modal logic with inclusion atoms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the succinctness of atoms of dependency")
  Member "complexity of propositional independence and inclusion logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "canonical models and the complexity of modal team logic")
  Member "approximation and dependence via multiteam semantics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "descriptive complexity of real computation and probabilistic independence logic")
  Member "modal inclusion logic being lax is simpler than being strict":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "canonical models and the complexity of modal team logic")
  Member "the expressive power of modal dependence logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the succinctness of atoms of dependency")

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)