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: "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.

Connected through hyperedge HE-1 (induced by source paper "enumeration complexity of poor man s propositional dependence logic"):
  with members:
    - "complexity of propositional independence and inclusion logic"
    - "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-2 (induced by source paper "validity and entailment in modal and propositional dependence logics"):
  with members:
    - "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"
    - "complexity of propositional independence and inclusion logic"
    - "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-3 (induced by source paper "the entailment problem in modal and propositional dependence logics"):
  with members:
    - "complete problems of propositional logic for the exponential hierarchy"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "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-4 (induced by source paper "approximation and dependence via multiteam semantics"):
  with members:
    - "tractability frontier of data complexity in team semantics"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "complexity of propositional logics in team semantics"):
  with members:
    - "complete problems of propositional logic for the exponential hierarchy"
    - "modal inclusion logic being lax is simpler than being strict"
    - "a van benthem theorem for modal team semantics"
    - "complexity of validity for propositional dependence logics"
    - "axiomatizing propositional dependence logics"
    - "dependence and independence"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"

Connected through hyperedge HE-6 (induced by source paper "satisfiability of modal inclusion logic lax and strict semantics"):
  with members:
    - "the entailment problem in modal and propositional dependence logics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "modal independence logic"
    - "inclusion logic and fixed point logic"
    - "complexity of model checking for modal dependence logic"
    - "complexity of the guarded two variable fragment with counting quantifiers"

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)