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: "towards automated integration of guess and check programs in answer set programming a meta interpreter and applications"
  Abstract: Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise and intuitive way, where the encoding reflects the typical "guess and check" nature of NP problems: The property is encoded in a way such that polynomial size certificates for it correspond to stable models of a program. However, the problem-solving capacity of full disjunctive logic programs (DLPs) is beyond NP, and captures a class of problems at the second level of the polynomial hierarchy. While these problems also have a clear "guess and check" structure, finding an encoding in a DLP reflecting this structure may sometimes be a non-obvious task, in particular if the "check" itself is a coNP-complete problem; usually, such problems are solved by interleaving separate guess and check programs, where the check is expressed by inconsistency of the check program. In this paper, we present general transformations of head-cycle free (extended) disjunctive logic programs into stratified and positive (extended) disjunctive logic programs based on meta-interpretation techniques. The answer sets of the original and the transformed program are in simple correspondence, and, moreover, inconsistency of the original program is indicated by a designated answer set of the transformed program. Our transformations facilitate the integration of separate "guess" and "check" programs, which are often easy to obtain, automatically into a single disjunctive logic program. Our results complement recent results on meta-interpretation in ASP, and extend methods and techniques for a declarative "guess and check" problem solving paradigm through ASP.

Connected through hyperedge HE-1 (induced by source paper "plasp 3 towards effective asp planning"):
  with members:
    - "clingo asp control preliminary report"
    - "the fast downward planning system"
    - "domain dependent knowledge in answer set planning"

Connected through hyperedge HE-2 (induced by source paper "beyond np quantifying over answer sets"):
  with members:
    - "stable unstable semantics beyond np with normal logic programs"
    - "complex optimization in answer set programming"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-3 (induced by source paper "technical report inconsistency in answer set programs and extensions"):
  with members:
    - "stable unstable semantics beyond np with normal logic programs"
    - "a model building framework for answer set programming with external computations"
    - "a knowledge compilation map"

Connected through hyperedge HE-4 (induced by source paper "sketched answer set programming"):
  with members:
    - "iterative learning of answer set programs from context dependent examples"
    - "jsketch sketching for java"
    - "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3"
    - "predicate logic as a modelling language the idp system"

Connected through hyperedge HE-5 (induced by source paper "stable unstable semantics beyond np with normal logic programs"):
  with members:
    - "optimizing phylogenetic supertrees using answer set programming"
    - "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3"
    - "simulating dynamic systems using linear time calculus theories"
    - "complex optimization in answer set programming"
    - "the dlv system for knowledge representation and reasoning"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-6 (induced by source paper "the power of non ground rules in answer set programming"):
  with members:
    - "asperix a first order forward chaining approach for answer set computing"
    - "rewriting ontological queries into small nonrecursive datalog programs"
    - "complex optimization in answer set programming"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-7 (induced by source paper "complex optimization in answer set programming"):
  with members:
    - "catching the ouroboros on debugging non ground answer set programs"
    - "the dlv system for knowledge representation and reasoning"
    - "computing preferred answer sets by meta interpretation in answer set programming"
    - "a framework for compiling preferences in logic programs"

Connected through hyperedge HE-8 (induced by source paper "a general approach to belief change in answer set programming"):
  with members:
    - "propositional theories are strongly equivalent to logic programs"
    - "the dlv system for knowledge representation and reasoning"
    - "updates in answer set programming an approach based on basic structural properties"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "computing preferred answer sets by meta interpretation in answer set programming"
    - "a framework for compiling preferences in logic programs"
    - "on properties of update sequences based on causal rejection"

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)