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 type theoretic approach to resolution"
  Abstract: We propose a new type-theoretic approach to SLD-resolution and Horn-clause logic programming. It views Horn formulas as types, and derivations for a given query as a construction of the inhabitant (a proof-term) for the type given by the query. We propose a method of program transformation that allows to transform logic programs in such a way that proof evidence is computed alongside SLD-derivations. We discuss two applications of this approach: in recently proposed productivity theory of structural resolution, and in type class inference.

Connected through hyperedge HE-1 (induced by source paper "logic programming laxness and saturation"):
  with members:
    - "productive corecursion in logic programming"
    - "a productivity checker for logic programming"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "category theoretic semantics for theorem proving in logic programming embracing the laxness"
    - "bialgebraic semantics for logic programming"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"

Connected through hyperedge HE-2 (induced by source paper "category theoretic semantics for theorem proving in logic programming embracing the laxness"):
  with members:
    - "bialgebraic semantics for logic programming"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "exploiting parallelism in coalgebraic logic programming"
    - "coalgebraic logic programming from semantics to implementation"
    - "an interactive semantics of logic programming"

Connected through hyperedge HE-3 (induced by source paper "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"):
  with members:
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-4 (induced by source paper "proof relevant corecursive resolution"):
  with members:
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"

Connected through hyperedge HE-5 (induced by source paper "structural resolution for logic programming"):
  with members:
    - "a type theoretic approach to structural resolution"
    - "coalgebraic logic programming from semantics to implementation"

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)