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: "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
  Abstract: Answer Set Programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP solvers. Experiments show that the performance of ASP solvers could be significantly improved by embedding domain-specific heuristics, but a proper effective integration of such criteria in off-the-shelf ASP implementations is not obvious. In this paper the combination of ASP and domain-specific heuristics is studied with the goal of effectively solving real-world problem instances of PUP and CCP. As a byproduct of this activity, the ASP solver WASP was extended with an interface that eases embedding new external heuristics in the solver. The evaluation shows that our domain-heuristic-driven ASP solver finds solutions for all the real-world instances of PUP and CCP ever provided by Siemens. This paper is under consideration for acceptance in TPLP.

Connected through hyperedge HE-1 (induced by source paper "the external interface for extending wasp"):
  with members:
    - "shared aggregate sets in answer set programming"
    - "constraint answer set solver ezcsp and why integration schemas matter"
    - "constraints lazy constraints or propagators in asp solving an empirical analysis"
    - "modeling variations of first order horn abduction in answer set programming"
    - "optimizing phylogenetic supertrees using answer set programming"
    - "generating explanations for biomedical queries"
    - "clingo asp control preliminary report"
    - "asp modulo csp the clingcon system"

Connected through hyperedge HE-2 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers"):
  with members:
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "asperix a first order forward chaining approach for answer set computing"
    - "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3"
    - "a multi engine approach to answer set programming"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "team building with answer set programming in the gioia tauro seaport"
    - "satzilla portfolio based algorithm selection for sat"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-3 (induced by source paper "debugging non ground asp programs technique and graphical tools"):
  with members:
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "justifying answer sets using argumentation"
    - "optimizing phylogenetic supertrees using answer set programming"
    - "generating explanations for biomedical queries"
    - "a web based ide for idp"
    - "the third open answer set programming competition"
    - "unit testing in aspide"
    - "catching the ouroboros on debugging non ground answer set programs"

Connected through hyperedge HE-4 (induced by source paper "better paracoherent answer sets with less resources"):
  with members:
    - "on the computation of paracoherent answer sets"
    - "multi shot asp solving with clingo"
    - "query answering in resource based answer set semantics"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "improved answer set programming encodings for abstract argumentation"
    - "on the tractability of minimal model computation for some cnf theories"
    - "the dlv system for knowledge representation and reasoning"
    - "flux a logic programming method for reasoning agents"

Connected through hyperedge HE-5 (induced by source paper "exploiting partial knowledge in declarative domain specific heuristics for asp"):
  with members:
    - "the seventh answer set programming competition design and results"
    - "degrees of laziness in grounding effects of lazy grounding strategies on asp solving"
    - "asperix a first order forward chaining approach for answer set computing"
    - "clingo asp control preliminary report"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "team building with answer set programming in the gioia tauro seaport"
    - "logic programs with propositional connectives and aggregates"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-6 (induced by source paper "shared aggregate sets in answer set programming"):
  with members:
    - "asp core 2 input language format"
    - "constraints lazy constraints or propagators in asp solving an empirical analysis"
    - "clingcon the next generation"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3"
    - "complexity and compilation of gz aggregates in answer set programming"
    - "rewriting recursive aggregates in answer set programming back to monotonicity"
    - "vicious circle principle and logic programs with aggregates"

Connected through hyperedge HE-7 (induced by source paper "cautious reasoning in asp via minimal models and unsatisfiable cores"):
  with members:
    - "on the computation of paracoherent answer sets"
    - "model enumeration in propositional circumscription via unsatisfiable core analysis"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "anytime computation of cautious consequences in answer set programming"
    - "the third open answer set programming competition"
    - "consistent query answering via asp from different perspectives theory and practice"
    - "disjunctive asp with functions decidable queries and effective computation"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-8 (induced by source paper "constraints lazy constraints or propagators in asp solving an empirical analysis"):
  with members:
    - "constraint answer set solver ezcsp and why integration schemas matter"
    - "the power of non ground rules in answer set programming"
    - "a model building framework for answer set programming with external computations"
    - "modeling variations of first order horn abduction in answer set programming"
    - "the dlvhex system for knowledge representation recent advances system description"
    - "optimizing phylogenetic supertrees using answer set programming"
    - "generating explanations for biomedical queries"
    - "lazy model expansion interleaving grounding with search"

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)