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: "termination proofs for logic programs with tabling"
  Abstract: Tabled logic programming is receiving increasing attention in the Logic Programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often extremely efficient execution mechanism for logic programs. In particular, tabled execution of logic programs terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming with Tabling: quasi-termination and (the stronger notion of) LG-termination. We present sufficient conditions for these two notions of termination, namely quasi-acceptability and LG-acceptability, and we show that these conditions are also necessary in case the tabling is well-chosen. Starting from these conditions, we give modular termination proofs, i.e., proofs capable of combining termination proofs of separate programs to obtain termination proofs of combined programs. Finally, in the presence of mode information, we state sufficient conditions which form the basis for automatically proving termination in a constraint-based way.

Connected through hyperedge HE-1 (induced by source paper "using linear constraints for logic program termination analysis"):
  with members:
    - "checking termination of bottom up evaluation of logic programs with function symbols"
    - "well definedness and efficient inference for probabilistic logic programming under the distribution semantics"
    - "non termination analysis of logic programs with integer arithmetics"
    - "disjunctive asp with functions decidable queries and effective computation"
    - "automated termination analysis for logic programs with cut"
    - "automated termination proofs for logic programs by term rewriting"
    - "on termination of meta programs"

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"
    - "cti a constraint based termination inference tool for iso prolog"
    - "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"
    - "practical methods for proving termination of general logic programs"

Connected through hyperedge HE-3 (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"
    - "a dynamic approach to characterizing termination of general logic programs"

Connected through hyperedge HE-4 (induced by source paper "a dynamic approach to characterizing termination of general logic programs"):
  with members:
    - "slt resolution for the well founded semantics"

Connected through hyperedge HE-5 (induced by source paper "classes of terminating logic programs"):
  with members:
    - "semantics and termination of simply moded logic programs with dynamic scheduling"
    - "properties of input consuming derivations"
    - "verifying termination and error freedom of logic programs with block declarations"
    - "detecting unsolvable queries for definite logic programs"

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

Connected through hyperedge HE-7 (induced by source paper "on termination of meta programs"):
  with members:
    - "acceptability with general orderings"
    - "a general framework for automatic termination analysis of logic programs"

Connected through hyperedge HE-8 (induced by source paper "verifying termination of general logic programs with concrete queries"):
  with members:
    - "linear tabulated resolution based on prolog control strategy"

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)