human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "structural resolution for abstract compilation of object oriented languages"):
  Abstract: We propose abstract compilation for precise static type analysis of object-oriented languages based on coinductive logic programming. Source code is translated to a logic program, then type-checking and inference problems amount to queries to be solved with respect to the resulting logic program. We exploit a coinductive semantics to deal with infinite terms and proofs produced by recursive types and methods. Thanks to the recent notion of structural resolution for coinductive logic programming, we are able to infer very precise type information, including a class of irrational recursive types causing non-termination for previously considered coinductive semantics. We also show how to transform logic programs to make them satisfy the preconditions for the operational semantics of structural resolution, and we prove this step does not affect the semantics of the logic program.

Includes members:
  Member "productive corecursion in logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "a productivity checker for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "productive corecursion in logic programming")
  Member "operational semantics of resolution and productivity in horn clause logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proof relevant horn clauses for dependent type inference and term synthesis")
  Member "proof relevant corecursive resolution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coinduction in uniform foundations for corecursive proof search with horn clauses")
  Member "structural resolution for logic programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "productive corecursion in logic programming")
  Member "structural resolution a framework for coinductive proof search and proof construction in horn clause logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coaxioms flexible coinductive definitions by inference systems")
  Member "coalgebraic logic programming from semantics to implementation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "productive corecursion in logic programming")

Question: Please tell me which class the source paper 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.PL(Programming Languages)