human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "resource usage analysis of logic programs via abstract interpretation using sized types"):
  Abstract: We present a novel general resource analysis for logic programs based on sized types. Sized#R##N#types are representations that incorporate structural (shape) information and allow expressing#R##N#both lower and upper bounds on the size of a set of terms and their subterms at any position#R##N#and depth. They also allow relating the sizes of terms and subterms occurring at different#R##N#argument positions in logic predicates. Using these sized types, the resource analysis can infer#R##N#both lower and upper bounds on the resources used by all the procedures in a program#R##N#as functions on input term (and subterm) sizes, overcoming limitations of existing resource#R##N#analyses and enhancing their precision. Our new resource analysis has been developed within#R##N#the abstract interpretation framework, as an extension of the sized types abstract domain,#R##N#and has been integrated into the Ciao preprocessor, CiaoPP. The abstract domain operations#R##N#are integrated with the setting up and solving of recurrence equations for inferring both size#R##N#and resource usage functions. We show that the analysis is an improvement over the previous#R##N#resource analysis present in CiaoPP and compares well in power to state of the art systems.

Includes members:
  Member "purrs towards computer algebra support for fully automatic worst case complexity analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a calculus for modular loop acceleration")
  Member "more precise yet efficient type inference for logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "evaluation of the implementation of an abstract interpretation algorithm using tabled clp")

Question: Please tell me which class the source paper 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.PL(Programming Languages)