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: "enhancing global sls resolution with loop cutting and tabling mechanisms"
  Abstract: Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. It inherits from SLDNF-resolution the {\em linearity} property of derivations, which makes it easy and efficient to implement using a simple stack-based memory structure. However, like SLDNF-resolution it suffers from the problem of infinite loops and redundant computations. To resolve this problem, in this paper we develop a new procedural semantics, called {\em SLTNF-resolution}, by enhancing Global SLS-resolution with loop cutting and tabling mechanisms. SLTNF-resolution is sound and complete w.r.t. the well-founded semantics for logic programs with the bounded-term-size property, and is superior to existing linear tabling procedural semantics such as SLT-resolution.

Connected through hyperedge HE-1 (induced by source paper "computing stable models of normal logic programs without grounding"):
  with members:
    - "a physician advisory system for chronic heart failure management based on knowledge patterns"
    - "dynamic consistency checking in goal directed answer set programming"
    - "xsb extending prolog with tabled logic programming"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-2 (induced by source paper "termination prediction for general logic programs"):
  with members:
    - "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"
    - "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 "deriving a stationary dynamic bayesian network from a logic program with recursive loops"):
  with members:
    - "relational bayesian networks"
    - "discriminative probabilistic models for relational data"
    - "a dynamic approach to characterizing termination of general logic programs"
    - "parameter learning of logic programs for symbolic statistical modeling"

Connected through hyperedge HE-4 (induced by source paper "termination analysis of general logic programs for moded queries a dynamic approach"):
  with members:
    - "inferring termination conditions for logic programs using backwards analysis"
    - "a dynamic approach to characterizing termination of general 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.LO(Logic in Computer Science)