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: "propositional theories are strongly equivalent to logic programs"
  Abstract: This paper presents a property of propositional theories under the answer sets semantics (called Equilibrium Logic for this general syntax): any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two different proofs for this result: one involving a syntactic transformation, and one that constructs a program starting from the countermodels of the theory in the intermediate logic of here-and-there.

Connected through hyperedge HE-1 (induced by source paper "implementing dynamic answer set programming"):
  with members:
    - "temporal answer set programming on finite traces"
    - "experimenting with robotic intra logistics domains"
    - "reasoning about actions with temporal answer sets"
    - "domain dependent knowledge in answer set planning"

Connected through hyperedge HE-2 (induced by source paper "strong equivalence for lpmln programs"):
  with members:
    - "weight learning in a probabilistic extension of answer set programs"
    - "a probabilistic extension of action language bc"
    - "computing lpmln using asp and mln solvers"
    - "logic tensor networks for semantic image interpretation"
    - "tensorlog a differentiable deductive database"
    - "probabilistic reasoning with answer sets"
    - "diagnostic reasoning with a prolog"

Connected through hyperedge HE-3 (induced by source paper "a syntactic operator for forgetting that satisfies strong persistence"):
  with members:
    - "when you must forget beyond strong persistence when forgetting in answer set programming"
    - "propositional independence formula variable independence and forgetting"

Connected through hyperedge HE-4 (induced by source paper "characterization of logic program revision as an extension of propositional revision"):
  with members:
    - "the rise and fall of semantic rule updates based on se models"
    - "linear logic based analysis of constraint handling rules with disjunction"
    - "an abductive framework for computing knowledge base updates"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "on properties of update sequences based on causal rejection"

Connected through hyperedge HE-5 (induced by source paper "a denotational semantics for equilibrium logic"):
  with members:
    - "the rise and fall of semantic rule updates based on se models"
    - "a general framework for equivalences in answer set programming by countermodels in the logic of here and there"
    - "a common view on strong uniform and other notions of equivalence in answer set programming"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-6 (induced by source paper "the rise and fall of semantic rule updates based on se models"):
  with members:
    - "splitting and updating hybrid knowledge bases"
    - "a program level approach to revising logic programs under the answer set semantics"
    - "updates in answer set programming an approach based on basic structural properties"
    - "an abductive framework for computing knowledge base updates"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "on properties of update sequences based on causal rejection"

Connected through hyperedge HE-7 (induced by source paper "reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming"):
  with members:
    - "first order stable model semantics and first order loop formulas"
    - "tight logic programs"
    - "compiling causal theories to successor state axioms and strips like systems"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-8 (induced by source paper "a general framework for equivalences in answer set programming by countermodels in the logic of here and there"):
  with members:
    - "modularity aspects of disjunctive stable models"
    - "relativized hyperequivalence of logic programs for modular programming"
    - "discovering classes of strongly equivalent logic programs"
    - "a common view on strong uniform and other notions of equivalence in answer set programming"
    - "the dlv system for knowledge representation and reasoning"
    - "semantical characterizations and complexity of equivalences in answer set programming"

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)