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: "structural resolution a framework for coinductive proof search and proof construction in horn clause logic"
  Abstract: Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained in programs' greatest complete Herbrand models. State-of-the-art algorithms implementing corecursion in LP are based on loop detection. However, such algorithms support inference of logical entailment only for rational terms, and they do not account for the important property of productivity in infinite SLD-computations. Loop detection thus lags behind coinductive methods in interactive theorem proving (ITP) and term-rewriting systems (TRS). #R##N#Structural resolution is a newly proposed alternative to SLD-resolution that makes it possible to define and semi-decide a notion of productivity appropriate to LP. In this paper, we prove soundness of structural resolution relative to Herbrand model semantics for productive inductive, coinductive, and mixed inductive-coinductive logic programs. #R##N#We introduce two algorithms that support coinductive proof search for infinite productive terms. One algorithm combines the method of loop detection with productive structural resolution, thus guaranteeing productivity of coinductive proofs for infinite rational terms. The other allows to make lazy sound observations of fragments of infinite irrational productive terms. This puts coinductive methods in LP on par with productivity-based observational approaches to coinduction in ITP and TRS.

Connected through hyperedge HE-1 (induced by source paper "coaxioms flexible coinductive definitions by inference systems"):
  with members:
    - "extending coinductive logic programming with co facts"
    - "generalizing inference systems by coaxioms"
    - "tabling rational terms and coinduction finally together"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-2 (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"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "proof relevant corecursive resolution"
    - "structural resolution for logic programming"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-3 (induced by source paper "structural resolution with co inductive loop detection"):
  with members:
    - "a productivity checker for logic programming"
    - "structural resolution for logic programming"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-4 (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"
    - "a type theoretic approach to resolution"
    - "structural resolution for logic programming"

Connected through hyperedge HE-5 (induced by source paper "a productivity checker for logic programming"):
  with members:
    - "productive corecursion in logic programming"
    - "operational semantics of resolution and productivity in horn clause logic"
    - "structural resolution for logic programming"
    - "exploiting parallelism in coalgebraic logic programming"
    - "coalgebraic logic programming from semantics to implementation"

Connected through hyperedge HE-6 (induced by source paper "operational semantics of resolution and productivity in horn clause logic"):
  with members:
    - "a productivity checker for logic programming"
    - "proof relevant corecursive resolution"
    - "structural resolution for 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:
    - "operational semantics of resolution and productivity in horn clause logic"
    - "proof relevant corecursive resolution"
    - "proving correctness of imperative programs by linearizing constrained horn clauses"

Connected through hyperedge HE-8 (induced by source paper "proof relevant corecursive resolution"):
  with members:
    - "a type theoretic approach to resolution"
    - "structural resolution for logic programming"

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)