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: "more precise yet efficient type inference for logic programs"
  Abstract: Type analyses of logic programs which aim at inferring the types of the program being analyzed are presented in a unified abstract interpretation-based framework. This covers most classical abstract interpretation-based type analyzers for logic programs, built on either top-down or bottom-up interpretation of the program. In this setting, we discuss the widening operator, arguably a crucial one. We present a new widening which is more precise than those previously proposed. Practical results with our analysis domain are also presented, showing that it also allows for efficient analysis.

Connected through hyperedge HE-1 (induced by source paper "evaluation of the implementation of an abstract interpretation algorithm using tabled clp"):
  with members:
    - "description implementation and evaluation of a generic design for tabled clp"
    - "tchr a framework for tabled clp"
    - "on a theory of probabilistic deductive databases"

Connected through hyperedge HE-2 (induced by source paper "a three valued semantics for typed logic programming"):
  with members:
    - "a three valued semantics for logic programmers"

Connected through hyperedge HE-3 (induced by source paper "interval based resource usage verification by translation into horn clauses and an application to energy consumption"):
  with members:
    - "energy transparency for deeply embedded programs"
    - "towards energy consumption verification via static analysis"
    - "inferring parametric energy consumption functions at different software levels isa vs llvm ir"
    - "resource usage analysis of logic programs via abstract interpretation using sized types"
    - "higher order symbolic execution via contracts"

Connected through hyperedge HE-4 (induced by source paper "towards energy consumption verification via static analysis"):
  with members:
    - "resource usage analysis of logic programs via abstract interpretation using sized types"

Connected through hyperedge HE-5 (induced by source paper "resource usage analysis of logic programs via abstract interpretation using sized types"):
  with members:
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-6 (induced by source paper "towards an abstract domain for resource analysis of logic programs using sized types"):
  with members:
    - "purrs towards computer algebra support for fully automatic worst case complexity analysis"

Connected through hyperedge HE-7 (induced by source paper "an overview of ciao and its design philosophy"):
  with members:
    - "description and optimization of abstract machines in a dialect of prolog"
    - "on the generation of test data for prolog by partial evaluation"
    - "distributed www programming using ciao prolog and the pillow library"

Connected through hyperedge HE-8 (induced by source paper "automated termination proofs for logic programs by term rewriting"):
  with members:
    - "cti a constraint based termination inference tool for iso prolog"
    - "inference of termination conditions for numerical loops in prolog"
    - "acceptability with general orderings"
    - "on termination of meta programs"

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.SE(Software Engineering)