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: "cti a constraint based termination inference tool for iso prolog"
  Abstract: We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, for instance by means of user annotations. Moreover, the analysis must be redone every time the class of queries of interest is updated. Termination inference, in contrast, requires neither user annotations nor recomputation. In this approach, terminating classes for all predicates are inferred at once. We describe the architecture of cTI and report an extensive experimental evaluation of the system covering many classical examples from the logic programming termination literature and several Prolog programs of respectable size and complexity.

Connected through hyperedge HE-1 (induced by source paper "correctness and completeness of logic programs"):
  with members:
    - "on definite program answers and least herbrand models"
    - "on completeness of logic programs"
    - "truth versus information in logic programming"
    - "logic control on program construction and verification"
    - "logic control an example of program construction"
    - "xsb extending prolog with tabled logic programming"
    - "polytool polynomial interpretations as a basis for termination analysis of logic programs"
    - "automated termination proofs for logic programs by term rewriting"

Connected through hyperedge HE-2 (induced by source paper "termination prediction for general logic programs"):
  with members:
    - "enhancing global sls resolution with loop cutting and tabling mechanisms"
    - "inferring termination conditions for logic programs using backwards analysis"
    - "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-3 (induced by source paper "polytool polynomial interpretations as a basis for termination analysis of logic programs"):
  with members:
    - "automated termination proofs for logic programs by term rewriting"
    - "acceptability with general orderings"

Connected through hyperedge HE-4 (induced by source paper "automated termination proofs for logic programs by term rewriting"):
  with members:
    - "more precise yet efficient type inference for logic programs"
    - "inference of termination conditions for numerical loops in prolog"
    - "acceptability with general orderings"
    - "on termination of meta programs"

Connected through hyperedge HE-5 (induced by source paper "applications of polyhedral computations to the analysis and verification of hardware and software systems"):
  with members:
    - "on the design of generic static analyzers for modern imperative languages"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-6 (induced by source paper "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"):
  with members:
    - "applications of polyhedral computations to the analysis and verification of hardware and software systems"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-7 (induced by source paper "finite tree analysis for constraint logic based languages the complete unabridged version"):
  with members:
    - "an application of rational trees in a logic programming interpreter for a procedural language"
    - "a correct precise and efficient integration of set sharing freeness and linearity for the analysis of finite and rational tree languages"
    - "enhanced sharing analysis techniques a comprehensive evaluation"
    - "soundness idempotence and commutativity of set sharing"
    - "decomposing non redundant sharing by complementation"

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)