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 "clingcon the next generation"):
  Abstract: We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating the CP solver gecode, the new clingcon system pursues a lazy approach using dedicated constraint propagators to extend propagation in the underlying ASP solver clasp. No extension is needed for parsing and grounding clingcon's hybrid modeling language since both can be accommodated by the new generic theory handling capabilities of the ASP grounder gringo. As a whole, clingcon 3 is thus an extension of the ASP system clingo 5, which itself relies on the grounder gringo and the solver clasp. The new approach of clingcon offers a seamless integration of CP propagation into ASP solving that benefits from the whole spectrum of clasp's reasoning modes, including for instance multi-shot solving and advanced optimization techniques. This is accomplished by a lazy approach that unfolds the representation of constraints and adds it to that of the logic program only when needed. Although the unfolding is usually dictated by the constraint propagators during solving, it can already be partially (or even totally) done during preprocessing. Moreover, clingcon's constraint preprocessing and propagation incorporate several well established CP techniques that greatly improve its performance. We demonstrate this via an extensive empirical evaluation contrasting, first, the various techniques in the context of CSP solving and, second, the new clingcon system with other hybrid ASP systems. Under consideration in Theory and Practice of Logic Programming (TPLP)

Includes members:
  Member "pddl planning via constraint answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "representing hybrid automata by action language modulo theories")
  Member "predicate logic as a modelling language the idp system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi shot asp solving with clingo")
  Member "clingo asp control preliminary report":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the external interface for extending wasp")
  Member "boolean equi propagation for concise and efficient sat encodings of combinatorial problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal depth sorting networks")
  Member "aspartame solving constraint satisfaction problems with answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "clingo goes linear constraints over reals and integers")
  Member "conflict driven asp solving with external sources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "inlining external sources in answer set programs")
  Member "asp modulo csp the clingcon system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the external interface for extending wasp")
  Member "introduction to the 28th international conference on logic programming special issue":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "claspfolio 2 advances in algorithm selection for answer set programming")

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.AI(Artificial Intelligence)