human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "complexity of propositional independence and inclusion logic"
  Abstract: We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence and inclusion logic and their extensions by the classical negation.

Connected through hyperedge HE-1 (induced by source paper "canonical models and the complexity of modal team logic"):
  with members:
    - "on the complexity of team logic and its two variable fragment"
    - "a fine grained hierarchy of hard problems in the separated fragment"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "complexity hierarchies beyond elementary"
    - "axiomatizations of team logics"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "modal inclusion logic being lax is simpler than being strict"

Connected through hyperedge HE-2 (induced by source paper "enumeration complexity of poor man s propositional dependence logic"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "paradigms for parameterized enumeration"
    - "dependence and independence"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"
    - "the complexity of poor man s logic"

Connected through hyperedge HE-3 (induced by source paper "model checking and validity in propositional and modal inclusion logics"):
  with members:
    - "team semantics for the specification and verification of hyperproperties"
    - "validity and entailment in modal and propositional dependence logics"
    - "axiomatizations of team logics"
    - "the expressive power of modal logic with inclusion atoms"
    - "approximation and dependence via multiteam semantics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "the expressive power of modal dependence logic"
    - "complexity of validity for propositional dependence logics"

Connected through hyperedge HE-4 (induced by source paper "validity and entailment in modal and propositional dependence logics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "complete problems of propositional logic for the exponential hierarchy"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"
    - "axiomatizing propositional dependence logics"

Connected through hyperedge HE-5 (induced by source paper "the entailment problem in modal and propositional dependence logics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "complete problems of propositional logic for the exponential hierarchy"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "modal inclusion logic being lax is simpler than being strict"
    - "the expressive power of modal dependence logic"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"

Connected through hyperedge HE-6 (induced by source paper "axiomatizations of team logics"):
  with members:
    - "validity and entailment in modal and propositional dependence logics"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "the expressive power of modal logic with inclusion atoms"
    - "modal inclusion logic being lax is simpler than being strict"
    - "a van benthem theorem for modal team semantics"
    - "axiomatizing propositional dependence logics"
    - "modal independence logic"
    - "dependence and independence"

Connected through hyperedge HE-7 (induced by source paper "on quantified propositional logics and the exponential time hierarchy"):
  with members:
    - "complete problems of propositional logic for the exponential hierarchy"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"

Connected through hyperedge HE-8 (induced by source paper "approximation and dependence via multiteam semantics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "tractability frontier of data complexity in team semantics"
    - "a team based variant of ctl"
    - "a van benthem theorem for modal team semantics"
    - "on independence atoms and keys"
    - "decidability of predicate logics with team semantics"
    - "context specific independence in bayesian networks"
    - "inclusion logic and fixed point logic"

Question: Please tell me which class the center node 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)