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: "computing datalog rewritings beyond horn ontologies"
  Abstract: Rewriting-based approaches for answering queries over an OWL 2 DL ontology have so far been developed mainly for Horn fragments of OWL 2 DL. In this paper, we study the possibilities of answering queries over non-Horn ontologies using datalog rewritings. We prove that this is impossible in general even for very simple ontology languages, and even if PTIME = NP. Furthermore, we present a resolution-based procedure for $\SHI$ ontologies that, in case it terminates, produces a datalog rewriting of the ontology. Our procedure necessarily terminates on DL-Lite_{bool}^H ontologies---an extension of OWL 2 QL with transitive roles and Boolean connectives.

Connected through hyperedge HE-1 (induced by source paper "computing horn rewritings of description logics ontologies"):
  with members:
    - "datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning"
    - "ontology based data access a study through disjunctive datalog csp and mmsnp"
    - "description logic tboxes model theoretic characterizations and rewritability"
    - "the dl lite family and relations"
    - "a knowledge compilation map"

Connected through hyperedge HE-2 (induced by source paper "beyond owl 2 ql in obda rewritings and approximations extended version"):
  with members:
    - "description logic tboxes model theoretic characterizations and rewritability"

Connected through hyperedge HE-3 (induced by source paper "datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning"):
  with members:
    - "ontology based data access a study through disjunctive datalog csp and mmsnp"
    - "the dl lite family and relations"
    - "hypertableau reasoning for description logics"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-4 (induced by source paper "ontology based data access a study through disjunctive datalog csp and mmsnp"):
  with members:
    - "querying the guarded fragment"
    - "exponential lower bounds and separation for query rewriting"
    - "type elimination based reasoning for the description logic shiqbs using decision diagrams and disjunctive datalog"
    - "rewriting ontological queries into small nonrecursive datalog programs"
    - "universal structures and the logic of forbidden patterns"
    - "a characterisation of first order constraint satisfaction problems"

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)