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: "planning with preferences using logic programming"
  Abstract: We present a declarative language, PP, for the high-level specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over such preferences. The semantics of PP allows the identification of most preferred trajectories for a given goal. We also provide an answer set programming implementation of planning problems with PP preferences.

Connected through hyperedge HE-1 (induced by source paper "complexity results for preference aggregation over m cp nets pareto and majority voting"):
  with members:
    - "achieving new upper bounds for the hypergraph duality problem through logic"
    - "on the complexity of core kernel and bargaining set"
    - "non transferable utility coalitional games via mixed integer linear constraints"
    - "the computational complexity of dominance and consistency in cp nets"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"

Connected through hyperedge HE-2 (induced by source paper "logical fuzzy optimization"):
  with members:
    - "logical fuzzy preferences"
    - "logic programming with ordered disjunction"

Connected through hyperedge HE-3 (induced by source paper "logical probability preferences"):
  with members:
    - "logic programming with ordered disjunction"

Connected through hyperedge HE-4 (induced by source paper "logical stochastic optimization"):
  with members:
    - "logic programming with ordered disjunction"

Connected through hyperedge HE-5 (induced by source paper "logical fuzzy preferences"):
  with members:
    - "logic programming with ordered disjunction"

Connected through hyperedge HE-6 (induced by source paper "expressing preferences using preference set constraint atoms"):
  with members:
    - "on the expressibility of stable logic programming"
    - "logic programming with ordered disjunction"
    - "extending the stable model semantics with more expressive rules"

Connected through hyperedge HE-7 (induced by source paper "planning with partial preference models"):
  with members:
    - "learning probabilistic hierarchical task networks to capture user preferences"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"
    - "sapa a multi objective metric temporal planner"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "decision theoretic planning structural assumptions and computational leverage"

Connected through hyperedge HE-8 (induced by source paper "reasoning about actions with temporal answer sets"):
  with members:
    - "the dlv system for knowledge representation and reasoning"
    - "bounded ltl model checking with stable models"
    - "diagnostic reasoning with a prolog"
    - "a logic programming approach to knowledge state planning ii the dlv k system"
    - "domain dependent knowledge in answer set planning"

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)