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: "design and implementation of aggregate functions in the dlv system"
  Abstract: Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows for expressing every property of finite structures that is decidable in the complexity class SigmaP2 (= NP^NP). Despite this high expressiveness, there are some simple properties, often arising in real-world applications, which cannot be encoded in a simple and natural manner. Especially properties that require the use of arithmetic operators (like sum, times, or count) on a set or multiset of elements, which satisfy some conditions, cannot be naturally expressed in classic DLP. #R##N#To overcome this deficiency, we extend DLP by aggregate functions in a conservative way. In particular, we avoid the introduction of constructs with disputed semantics, by requiring aggregates to be stratified. We formally define the semantics of the extended language (called DLP^A), and illustrate how it can be profitably used for representing knowledge. Furthermore, we analyze the computational complexity of DLP^A, showing that the addition of aggregates does not bring a higher cost in that respect. Finally, we provide an implementation of DLP^A in DLV -- a state-of-the-art DLP system -- and report on experiments which confirm the usefulness of the proposed extension also for the efficiency of computation.

Connected through hyperedge HE-1 (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"
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "hybrid asp based approach to pattern mining"):
  with members:
    - "reductions for frequency based data mining problems"
    - "knowledge representation analysis of graph mining"
    - "an efficient algorithm for mining frequent sequence with constraint programming"
    - "graph isomorphism in quasipolynomial time"
    - "constraint based sequence mining using constraint programming"
    - "using answer set programming for pattern mining"
    - "a constraint programming approach for mining sequential patterns in a sequence database"

Connected through hyperedge HE-3 (induced by source paper "the causality repair connection in databases causality programs"):
  with members:
    - "consistency and trust in peer data exchange systems"
    - "quantifying causal effects on query answering in databases"
    - "causes for query answers from databases datalog abduction view updates and integrity constraints"
    - "achieving data privacy through secrecy views and null based virtual updates"
    - "the complexity of causality and responsibility for query answers and non answers"
    - "the dlv system for knowledge representation and reasoning"
    - "responsibility and blame a structural model approach"
    - "answer sets for consistent query answering in inconsistent databases"

Connected through hyperedge HE-4 (induced by source paper "solving stable matching problems using answer set programming"):
  with members:
    - "modeling stable matching problems with answer set programming"
    - "tight logic programs"

Connected through hyperedge HE-5 (induced by source paper "rewriting recursive aggregates in answer set programming back to monotonicity"):
  with members:
    - "anytime computation of cautious consequences in answer set programming"
    - "vicious circle principle and logic programs with aggregates"
    - "conflict driven asp solving with external sources"
    - "unfounded sets and well founded semantics of answer set programs with aggregates"
    - "relating weight constraint and aggregate programs semantics and representation"
    - "logic programs with propositional connectives and aggregates"
    - "properties and applications of programs with monotone and convex constraints"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-6 (induced by source paper "complexity and compilation of gz aggregates in answer set programming"):
  with members:
    - "anytime computation of cautious consequences in answer set programming"
    - "vicious circle principle and logic programs with aggregates"
    - "logic programs with propositional connectives and aggregates"
    - "properties and applications of programs with monotone and convex constraints"
    - "well founded and stable semantics of logic programs with aggregates"

Connected through hyperedge HE-7 (induced by source paper "the design of the fifth answer set programming competition"):
  with members:
    - "preliminary report on wasp 2 0"
    - "translating answer set programs into bit vector logic"
    - "the dlv system for knowledge representation and reasoning"
    - "tight logic programs"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-8 (induced by source paper "vicious circle principle and logic programs with aggregates"):
  with members:
    - "on the semantics of gringo"
    - "answer sets for logic programs with arbitrary abstract constraint atoms"
    - "the dlv system for knowledge representation and reasoning"
    - "well founded and stable semantics of logic programs with aggregates"
    - "weight constraints as nested expressions"

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)