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 results for modal dependence logic"
  Abstract: Modal dependence logic was introduced recently by V\"a\"an\"anen. It enhances the basic modal language by an operator =(). For propositional variables p_1,...,p_n, =(p_1,...,p_(n-1);p_n) intuitively states that the value of p_n is determined by those of p_1,...,p_(n-1). Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time. In this paper we consider fragments of modal dependence logic obtained by restricting the set of allowed propositional connectives. We show that satisfibility for poor man's dependence logic, the language consisting of formulas built from literals and dependence atoms using conjunction, necessity and possibility (i.e., disallowing disjunction), remains NEXPTIME-complete. If we only allow monotone formulas (without negation, but with disjunction), the complexity drops to PSPACE-completeness. We also extend V\"a\"an\"anen's language by allowing classical disjunction besides dependence disjunction and show that the satisfiability problem remains NEXPTIME-complete. If we then disallow both negation and dependence disjunction, satistiability is complete for the second level of the polynomial hierarchy. In this way we completely classify the computational complexity of the satisfiability problem for all restrictions of propositional and dependence operators considered by V\"a\"an\"anen and Sevenster.

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"
    - "complexity of propositional independence and inclusion logic"

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"
    - "complexity of propositional independence and inclusion logic"
    - "paradigms for parameterized enumeration"
    - "dependence and independence"
    - "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"
    - "complexity of propositional independence and inclusion logic"
    - "approximation and dependence via multiteam semantics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "the expressive power of modal dependence logic"

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"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for 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"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "complexity of propositional logics in team semantics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "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 of model checking for modal dependence logic"

Connected through hyperedge HE-7 (induced by source paper "the expressive power of modal logic with inclusion atoms"):
  with members:
    - "satisfiability of modal inclusion logic lax and strict 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"
    - "modal independence logic"
    - "complexity of model checking for modal dependence logic"

Connected through hyperedge HE-8 (induced by source paper "complexity of propositional independence and inclusion logic"):
  with members:
    - "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 of model checking for modal dependence 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)