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 "complexity of propositional logics in team semantics"):
  Abstract: We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations.

Includes members:
  Member "model checking and validity in propositional and modal inclusion logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enumeration complexity of poor man s propositional dependence logic")
  Member "complete problems of propositional logic for the exponential hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of the quantified bit vector arithmetic with binary encoding")
  Member "modal inclusion logic being lax is simpler than being strict":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "canonical models and the complexity of modal team logic")
  Member "a van benthem theorem for modal team semantics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the succinctness of atoms of dependency")
  Member "complexity of validity for propositional dependence logics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the succinctness of atoms of dependency")
  Member "axiomatizing propositional dependence logics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "model checking and validity in propositional and modal inclusion logics")
  Member "dependence and independence":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the succinctness of atoms of dependency")
  Member "complexity results for modal dependence logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "canonical models and the complexity of modal team logic")

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)