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: "a fast algorithm and datalog inexpressibility for temporal reasoning"
  Abstract: We introduce a new tractable temporal constraint language, which strictly contains the Ord-Horn language of Buerkert and Nebel and the class of AND/OR precedence constraints. The algorithm we present for this language decides whether a given set of constraints is consistent in time that is quadratic in the input size. We also prove that (unlike Ord-Horn) this language cannot be solved by Datalog or by establishing local consistency.

Connected through hyperedge HE-1 (induced by source paper "complexity classification in infinite domain constraint satisfaction"):
  with members:
    - "absorbing subalgebras cyclic terms and the constraint satisfaction problem"
    - "on the scope of the universal algebraic approach to constraint satisfaction"
    - "tractable set constraints"
    - "datalog and constraint satisfaction with infinite templates"
    - "cores of countably categorical structures"
    - "a characterisation of first order constraint satisfaction problems"
    - "linear datalog and bounded path duality of relational structures"
    - "a complete classification of tractability in rcc 5"

Connected through hyperedge HE-2 (induced by source paper "constraint satisfaction tractability from semi lattice operations on infinite sets"):
  with members:
    - "on the scope of the universal algebraic approach to constraint satisfaction"
    - "arc consistency and friends"
    - "cores of countably categorical structures"

Connected through hyperedge HE-3 (induced by source paper "the complexity of rooted phylogeny problems"):
  with members:
    - "datalog and constraint satisfaction with infinite templates"

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)