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: "stochastic constraint programming"
  Abstract: To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of traditional constraint satisfaction, stochastic integer programming, and stochastic satisfiability. We give a semantics for stochastic constraint programs, and propose a number of complete algorithms and approximation procedures. Finally, we discuss a number of extensions of stochastic constraint programming to relax various assumptions like the independence between stochastic variables, and compare with other approaches for decision making under uncertainty.

Connected through hyperedge HE-1 (induced by source paper "compiling stochastic constraint programs to and or decision diagrams"):
  with members:
    - "inference and learning in probabilistic logic programs using weighted boolean formulas"
    - "spudd stochastic planning using decision diagrams"
    - "solving sat and bayesian inference with backtracking search"
    - "and or multi valued decision diagrams aomdds for graphical models"
    - "stochastic constraint programming a scenario based approach"

Connected through hyperedge HE-2 (induced by source paper "constrained optimization under uncertainty for decision making problems application to real time strategy games"):
  with members:
    - "implementing a wall in building placement in starcraft with declarative programming"

Connected through hyperedge HE-3 (induced by source paper "stochastic constraint optimization using propagation on ordered binary decision diagrams"):
  with members:
    - "a differential approach to inference in bayesian networks"
    - "on the tractable counting of theory models and its application to belief revision and truth maintenance"

Connected through hyperedge HE-4 (induced by source paper "distributed constraint problems for utilitarian agents with privacy concerns recast as pomdps"):
  with members:
    - "bnb adopt an asynchronous branch and bound dcop algorithm"
    - "the complexity of reasoning with global constraints"
    - "asynchronous partial overlay a new algorithm for solving distributed constraint satisfaction problems"

Connected through hyperedge HE-5 (induced by source paper "xcsp3 an integrated format for benchmarking combinatorial constrained problems"):
  with members:
    - "short and long supports for constraint propagation"
    - "the seqbin constraint revisited"
    - "slide a useful special case of the cardpath constraint"
    - "decompositions of grammar constraints"
    - "finite domain bounds consistency revisited"
    - "the alldifferent constraint a survey"

Connected through hyperedge HE-6 (induced by source paper "the inductive constraint programming loop"):
  with members:
    - "satzilla portfolio based algorithm selection for sat"

Connected through hyperedge HE-7 (induced by source paper "the p box cdf intervals reliable constraint reasoning with quantifiable information"):
  with members:
    - "certainty closure reliable constraint reasoning with incomplete or erroneous data"

Connected through hyperedge HE-8 (induced by source paper "value elimination bayesian inference via backtracking search"):
  with members:
    - "context specific independence in bayesian networks"

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)