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: "linear tabulated resolution based on prolog control strategy"
  Abstract: Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checking can cut infinite loops, but it cannot be both sound and complete even for function-free logic programs. Tabling seems to be an effective way to resolve infinite loops and redundant computations. However, existing tabulated resolutions, such as OLDT-resolution, SLG- resolution, and Tabulated SLS-resolution, are non-linear because they rely on the solution-lookup mode in formulating tabling. The principal disadvantage of non-linear resolutions is that they cannot be implemented using a simple stack-based memory structure like that in Prolog. Moreover, some strictly sequential operators such as cuts may not be handled as easily as in Prolog. #R##N#In this paper, we propose a hybrid method to resolve infinite loops and redundant computations. We combine the ideas of loop checking and tabling to establish a linear tabulated resolution called TP-resolution. TP-resolution has two distinctive features: (1) It makes linear tabulated derivations in the same way as Prolog except that infinite loops are broken and redundant computations are reduced. It handles cuts as effectively as Prolog. (2) It is sound and complete for positive logic programs with the bounded-term-size property. The underlying algorithm can be implemented by an extension to any existing Prolog abstract machines such as WAM or ATOAM.

Connected through hyperedge HE-1 (induced by source paper "tabled typeclass resolution"):
  with members:
    - "type classes for efficient exact real arithmetic in coq"
    - "type classes for mathematics in type theory"
    - "xsb extending prolog with tabled logic programming"
    - "linear tabling strategies and optimizations"

Connected through hyperedge HE-2 (induced by source paper "gem a distributed goal evaluation algorithm for trust management"):
  with members:
    - "xsb extending prolog with tabled logic programming"
    - "nonmonotonic trust management for p2p applications"
    - "on applying or parallelism and tabling to logic programs"

Connected through hyperedge HE-3 (induced by source paper "linear tabling strategies and optimizations"):
  with members:
    - "on applying or parallelism and tabling to logic programs"
    - "parameter learning of logic programs for symbolic statistical modeling"

Connected through hyperedge HE-4 (induced by source paper "enhancing global sls resolution with loop cutting and tabling mechanisms"):
  with members:
    - "a dynamic approach to characterizing termination of general logic programs"
    - "on the problem of computing the well founded semantics"
    - "slt resolution for the well founded semantics"
    - "transformation based bottom up computation of the well founded model"

Connected through hyperedge HE-5 (induced by source paper "parameter learning of logic programs for symbolic statistical modeling"):
  with members:
    - "loglinear models for first order probabilistic reasoning"
    - "from statistical knowledge bases to degrees of belief"
    - "inside outside estimation of a lexicalized pcfg for german"
    - "probabilistic deduction with conditional constraints over basic events"
    - "exploiting causal independence in bayesian network inference"

Connected through hyperedge HE-6 (induced by source paper "verifying termination of general logic programs with concrete queries"):
  with members:
    - "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.AI(Artificial Intelligence)