human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "message based web service composition integrity constraints and planning under uncertainty a new connection"):
  Abstract: Thanks to recent advances, AI Planning has become the underlying technique for several applications. Figuring prominently among these is automated Web Service Composition (WSC) at the "capability" level, where services are described in terms of preconditions and effects over ontological concepts. A key issue in addressing WSC as planning is that ontologies are not only formal vocabularies; they also axiomatize the possible relationships between concepts. Such axioms correspond to what has been termed "integrity constraints" in the actions and change literature, and applying a web service is essentially a belief update operation. The reasoning required for belief update is known to be harder than reasoning in the ontology itself. The support for belief update is severely limited in current planning tools.#R##N##R##N#Our first contribution consists in identifying an interesting special case of WSC which is both significant and more tractable. The special case, which we term forward effects, is characterized by the fact that every ramification of a web service application involves at least one new constant generated as output by the web service. We show that, in this setting, the reasoning required for belief update simplifies to standard reasoning in the ontology itself. This relates to, and extends, current notions of "message-based" WSC, where the need for belief update is removed by a strong (often implicit or informal) assumption of "locality" of the individual messages. We clarify the computational properties of the forward effects case, and point out a strong relation to standard notions of planning under uncertainty, suggesting that effective tools for the latter can be successfully adapted to address the former.#R##N##R##N#Furthermore, we identify a significant sub-case, named strictly forward effects, where an actual compilation into planning under uncertainty exists. This enables us to exploit off-the-shelf planning tools to solve message-based WSC in a general form that involves powerful ontologies, and requires reasoning about partial matches between concepts. We provide empirical evidence that this approach may be quite effective, using Conformant-FF as the underlying planner.

Includes members:
  Member "the fast downward planning system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "planning graph heuristics for belief space search":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic epistemic logic with asp updates application to conditional planning")
  Member "where ignoring delete lists works local search topology in planning benchmarks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to rank for synthesizing planning heuristics")
  Member "pddl2 1 an extension to pddl for expressing temporal planning domains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "a logic programming approach to knowledge state planning ii the dlv k system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploiting partial knowledge in declarative domain specific heuristics for asp")
  Member "the 3rd international planning competition results and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning domain independent planning heuristics with hypergraph networks")
  Member "planning through stochastic local search and temporal action graphs in lpg":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "automated algorithm selection survey and perspectives")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")

Question: Please tell me which class the source paper 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)