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: "operational semantics of resolution and productivity in horn clause logic"
  Abstract: This paper presents a study of operational and type-theoretic properties of different resolution strategies in Horn clause logic. We distinguish four different kinds of resolution: resolution by unification (SLD-resolution), resolution by term-matching, the recently introduced structural resolution, and partial (or lazy) resolution. We express them all uniformly as abstract reduction systems, which allows us to undertake a thorough comparative analysis of their properties. To match this small-step semantics, we propose to take Howard's System H as a type-theoretic semantic counterpart. Using System H, we interpret Horn formulas as types, and a derivation for a given formula as the proof term inhabiting the type given by the formula. We prove soundness of these abstract reduction systems relative to System H, and we show completeness of SLD-resolution and structural resolution relative to System H. We identify conditions under which structural resolution is operationally equivalent to SLD-resolution. We show correspondence between term-matching resolution for Horn clause programs without existential variables and term rewriting.

Connected through hyperedge HE-1 (induced by source paper "proof relevant horn clauses for dependent type inference and term synthesis"):
  with members:
    - "proof relevant corecursive resolution"
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-2 (induced by source paper "first order answer set programming as constructive proof search"):
  with members:
    - "applications of intuitionistic logic in answer set programming"

Connected through hyperedge HE-3 (induced by source paper "structural resolution for abstract compilation of object oriented languages"):
  with members:
    - "productive corecursion in logic programming"
    - "a productivity checker 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"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-4 (induced by source paper "productive corecursion in logic programming"):
  with members:
    - "a productivity checker for logic programming"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "coalgebraic logic programming from semantics to implementation"
    - "a dynamic approach to characterizing termination of general logic programs"

Connected through hyperedge HE-5 (induced by source paper "logic programming laxness and saturation"):
  with members:
    - "productive corecursion in logic programming"
    - "a productivity checker for logic programming"
    - "category theoretic semantics for theorem proving in logic programming embracing the laxness"
    - "bialgebraic semantics for logic programming"
    - "proof relevant corecursive resolution"
    - "a type theoretic approach to 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-6 (induced by source paper "a productivity checker for logic programming"):
  with members:
    - "productive corecursion in logic programming"
    - "structural resolution for logic programming"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"
    - "exploiting parallelism in coalgebraic logic programming"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-7 (induced by source paper "coinductive soundness of corecursive type class resolution"):
  with members:
    - "proof relevant corecursive resolution"
    - "proving correctness of imperative programs by linearizing constrained horn clauses"
    - "structural resolution a framework for coinductive proof search and proof construction in horn clause 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)