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 "efficiently coupling the i dlv grounder with asp solvers"):
  Abstract: We present I-DLV+MS , a new Answer Set Programming (ASP) system that integrates an efficient grounder, namely I-DLV, with an automatic selector that inductively chooses a solver: depending on some inherent features of the instantiation produced by I-DLV, machine learning techniques guide the selection of the most appropriate solver. The system participated in the latest (7th) ASP competition, winning the regular track, category SP (i.e., one processor allowed). Under consideration in Theory and Practice of Logic Programming (TPLP).

Includes members:
  Member "combining answer set programming and domain heuristics for solving hard industrial problems application paper":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the external interface for extending wasp")
  Member "anytime answer set optimization via unsatisfiable core shrinking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "debugging non ground asp programs technique and graphical tools")
  Member "asperix a first order forward chaining approach for answer set computing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the seventh answer set programming competition design and results")
  Member "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the seventh answer set programming competition design and results")
  Member "a multi engine approach to answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the seventh answer set programming competition design and results")
  Member "claspfolio 2 advances in algorithm selection for answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exploiting partial knowledge in declarative domain specific heuristics for asp")
  Member "team building with answer set programming in the gioia tauro seaport":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "inconsistency proofs for asp the asp drupe format")
  Member "satzilla portfolio based algorithm selection for sat":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deciding the consistency of non linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings")

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.LO(Logic in Computer Science)