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: "inferring termination conditions for logic programs using backwards analysis"
  Abstract: This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined with backwards analysis to obtain an analyser for termination inference. We identify a condition on the components of the analyser which guarantees that termination inference will infer all modes which can be checked to terminate. The application of this methodology to enhance a traditional termination analyser to perform also termination inference is demonstrated.

Connected through hyperedge HE-1 (induced by source paper "termination prediction for general logic programs"):
  with members:
    - "enhancing global sls resolution with loop cutting and tabling mechanisms"
    - "cti a constraint based termination inference tool for iso prolog"
    - "a dynamic approach to characterizing termination of general logic programs"
    - "a general framework for automatic termination analysis of logic programs"
    - "termination proofs for logic programs with tabling"
    - "practical methods for proving termination of general logic programs"

Connected through hyperedge HE-2 (induced by source paper "termination analysis of general logic programs for moded queries a dynamic approach"):
  with members:
    - "enhancing global sls resolution with loop cutting and tabling mechanisms"
    - "a dynamic approach to characterizing termination of general logic programs"
    - "termination proofs for logic programs with tabling"

Connected through hyperedge HE-3 (induced by source paper "cti a constraint based termination inference tool for iso prolog"):
  with members:
    - "a backward analysis for constraint logic programs"
    - "inference of termination conditions for numerical loops in prolog"

Connected through hyperedge HE-4 (induced by source paper "inference of termination conditions for numerical loops in prolog"):
  with members:
    - "inference of termination conditions for numerical loops"
    - "a general framework for automatic termination analysis of logic programs"
    - "termination proofs for logic programs with tabling"

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.PL(Programming Languages)