human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "DL-Lite with attributes and datatypes"
  Abstract: We extend the DL-Lite languages by means of attributes and datatypes. Attributes—a notion borrowed from data models— associate concrete values from datatypes to abstract objects and in this way complement roles, which describe relationships between abstract objects. The extended languages remain tractable (with a notable exception) even though they contain both existential and (a limited form of) universal quantification. We present complexity results for two most important reasoning problems in DL-Lite: combined complexity of knowledge base satisfiability and data complexity of positive existential query answering.

Connected through hyperedge HE-1 (induced by source paper "On the complexity of the instance checking problem in concept languages with existential quantification"):
  with members:
    - "The tractability of subsumption in frame-based description languages"
    - "Data Complexity of Query Answering in Expressive Description Logics via Tableaux"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science