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: "a fragment of dependence logic capturing polynomial time"
  Abstract: In this paper we study the expressive power of Horn-formulae in dependence#N#logic and show that they can express NP-complete problems. Therefore we define#N#an even smaller fragment D-Horn* and show that over finite successor structures#N#it captures the complexity class P of all sets decidable in polynomial time.#N#Furthermore we study the question which of our results can ge generalized to#N#the case of open formulae of D-Horn* and so-called downwards monotone#N#polynomial time properties of teams.

Connected through hyperedge HE-1 (induced by source paper "complexity thresholds in inclusion logic"):
  with members:
    - "consistent query answering for primary keys in logspace"
    - "tractability frontier of data complexity in team semantics"
    - "complexity of propositional logics in team semantics"
    - "approximation and dependence via multiteam semantics"
    - "complexity of validity for propositional dependence logics"
    - "inclusion logic and fixed point logic"
    - "complexity of two variable dependence logic and if logic"
    - "minimal change integrity maintenance using tuple deletions"

Connected through hyperedge HE-2 (induced by source paper "tractability frontier of data complexity in team semantics"):
  with members:
    - "decidable fragments of logics based on team semantics"
    - "inclusion logic and fixed point logic"
    - "dependence and independence"
    - "complexity of two variable dependence logic and if logic"
    - "hierarchies in 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)