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: "constructing conditional plans by a theorem prover"
  Abstract: The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on. Without these assumptions the sequences of operations that achieve the goals depend on the initial state and the outcomes of nondeterministic changes in the system. This setting raises the questions of how to represent the plans and how to perform plan search. The answers are quite different from those in the simpler classical framework. In this paper, we approach conditional planning from a new viewpoint that is motivated by the use of satisfiability algorithms in classical planning. Translating conditional planning to formulae in the propositional logic is not feasible because of inherent computational limitations. Instead, we translate conditional planning to quantified Boolean formulae. We discuss three formalizations of conditional planning as quantified Boolean formulae, and present experimental results obtained with a theorem-prover.

Connected through hyperedge HE-1 (induced by source paper "dynamic epistemic logic with asp updates application to conditional planning"):
  with members:
    - "temporal answer set programming on finite traces"
    - "a survey of advances in epistemic logic program solvers"
    - "a gentle introduction to epistemic planning the del approach"
    - "simple epistemic planning generalised gossiping"
    - "planning graph heuristics for belief space search"
    - "a logic programming approach to knowledge state planning ii the dlv k system"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-2 (induced by source paper "planning under continuous time and resource uncertainty a challenge for ai"):
  with members:
    - "conformant planning via symbolic model checking"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-3 (induced by source paper "backdoors to satisfaction"):
  with members:
    - "the good the bad and the odd cycles in answer set programs"
    - "strong backdoors to bounded treewidth sat"
    - "strong backdoors to nested satisfiability"
    - "augmenting tractable fragments of abstract argumentation"
    - "backdoors to acyclic sat"
    - "3 sat faster and simpler unique sat bounds for ppsz hold in general"
    - "backdoors to tractable answer set programming"
    - "limits of preprocessing"

Connected through hyperedge HE-4 (induced by source paper "characterising equilibrium logic and nested logic programs reductions and complexity1 2"):
  with members:
    - "embedding non ground logic programs into autoepistemic logic for knowledge base combination"
    - "propositional theories are strongly equivalent to 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"
    - "tight logic programs"
    - "strong equivalence made easy nested expressions and weight constraints"
    - "characterization of strongly equivalent logic programs in intermediate logics"

Connected through hyperedge HE-5 (induced by source paper "reasoning and planning with sensing actions incomplete information and static causal laws using answer set programming"):
  with members:
    - "planning graph heuristics for belief space search"
    - "a logic programming approach to knowledge state planning ii the dlv k system"
    - "domain dependent knowledge in answer set planning"
    - "the ff planning system fast plan generation through heuristic search"
    - "conformant planning via symbolic model checking"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-6 (induced by source paper "regression with respect to sensing actions and partial states"):
  with members:
    - "2planning for contingencies a decision based approach"

Connected through hyperedge HE-7 (induced by source paper "a logic programming approach to knowledge state planning ii the dlv k system"):
  with members:
    - "conformant planning via symbolic model checking"

Connected through hyperedge HE-8 (induced by source paper "conformant planning via symbolic model checking"):
  with members:
    - "spudd stochastic planning using decision diagrams"

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)