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: "a dynamic approach to characterizing termination of general logic programs"
  Abstract: We present a new characterization of termination of general logic programs. Most existing termination analysis approaches rely on some static information about the structure of the source code of a logic program, such as modes/types, norms/level mappings, models/interargument relations, and the like. We propose a dynamic approach which employs some key dynamic features of an infinite (generalized) SLDNF-derivation, such as repetition of selected subgoals and recursive increase in term size. We also introduce a new formulation of SLDNF-trees, called generalized SLDNF-trees. Generalized SLDNF-trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs.

Connected through hyperedge HE-1 (induced by source paper "size change termination as a contract"):
  with members:
    - "soft contract verification for higher order stateful programs"
    - "abstracting definitional interpreters functional pearl"
    - "soft contract verification"
    - "from safety to termination and back smt based verification for lazy languages"
    - "abstracting abstract machines a systematic approach to higher order program analysis"
    - "higher order symbolic execution via contracts"
    - "abstracting abstract machines"

Connected through hyperedge HE-2 (induced by source paper "productive corecursion in logic programming"):
  with members:
    - "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 "non termination analysis of java bytecode"):
  with members:
    - "monotonicity constraints for termination in the integer domain"
    - "a non termination criterion for binary constraint logic programs"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

Connected through hyperedge HE-4 (induced by source paper "non termination analysis of logic programs with integer arithmetics"):
  with members:
    - "termination prediction for general logic programs"
    - "polytool polynomial interpretations as a basis for termination analysis of logic programs"
    - "inference of termination conditions for numerical loops in prolog"

Connected through hyperedge HE-5 (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"
    - "inferring termination conditions for logic programs using backwards analysis"
    - "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-6 (induced by source paper "deriving a stationary dynamic bayesian network from a logic program with recursive loops"):
  with members:
    - "relational bayesian networks"
    - "discriminative probabilistic models for relational data"
    - "enhancing global sls resolution with loop cutting and tabling mechanisms"
    - "parameter learning of logic programs for symbolic statistical modeling"

Connected through hyperedge HE-7 (induced by source paper "enhancing global sls resolution with loop cutting and tabling mechanisms"):
  with members:
    - "on the problem of computing the well founded semantics"
    - "slt resolution for the well founded semantics"
    - "linear tabulated resolution based on prolog control strategy"
    - "transformation based bottom up computation of the well founded model"

Connected through hyperedge HE-8 (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"
    - "inferring termination conditions for logic programs using backwards analysis"
    - "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.LO(Logic in Computer Science)