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 "termination prediction for general logic programs"):
  Abstract: We present a heuristic framework for attacking the undecidable termination problem of logic programs, as an alternative to current termination/non-termination proof approaches. We introduce an idea of termination prediction, which predicts termination of a logic program in case that neither a termination nor a non-termination proof is applicable. We establish a necessary and sufficient characterization of infinite (generalized) SLDNF-derivations with arbitrary (concrete or moded) queries, and develop an algorithm that predicts termination of general logic programs with arbitrary non-floundering queries. We have implemented a termination prediction tool and obtained quite satisfactory experimental results. Except for five programs which break the experiment time limit, our prediction is 100% correct for all 296 benchmark programs of the Termination Competition 2007, of which eighteen programs cannot be proved by any of the existing state-of-the-art analyzers like AProVE07, NTI, Polytool and TALP.

Includes members:
  Member "enhancing global sls resolution with loop cutting and tabling mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing stable models of normal logic programs without grounding")
  Member "cti a constraint based termination inference tool for iso prolog":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "correctness and completeness of logic programs")
  Member "inferring termination conditions for logic programs using backwards analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "termination analysis of general logic programs for moded queries a dynamic approach")
  Member "a dynamic approach to characterizing termination of general logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "size change termination as a contract")
  Member "a general framework for automatic termination analysis of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "unrestricted termination and non termination arguments for bit vector programs")
  Member "termination proofs for logic programs with tabling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "using linear constraints for logic program termination analysis")
  Member "practical methods for proving termination of general logic programs":
    also connected through other hyperedges:
      (none)

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)