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 "model theoretic characterisations of description logics"):
  Abstract: The growing need for computer aided processing of knowledge has led to an increasing interest in description logics (DLs), which are applied to encode knowledge in order to make it explicit and accessible to logical reasoning.    #R##N##R##N#DLs and in particular the family around the DL ALC  have therefore been thoroughly investigated w.r.t. their complexity theory and proof theory. The question arises which expressiveness these logics actually have. #R##N##R##N#The expressiveness of a logic can be inferred by a model theoretic characterisation. #R##N#On concept level, these DLs are akin to modal logics whose #R##N#model theoretic properties have been investigated. Yet the model theoretic investigation of the DLs with their TBoxes, which are an original part of DLs usually not considered in context of modal logics, have remained unstudied. #R##N##R##N#This thesis studies the model theoretic properties of ALC, ALCI, ALCQ, as well as ALCO, ALCQO, ALCQIO and EL. It presents model theoretic properties, which characterise these logics as fragments of the first order logic (FO). #R##N##R##N#The characterisations are not only carried out on concept level and on concept level extended by the universal role, but focus in particular on TBoxes.  The properties used  to characterise the logics are `natural' notions w.r.t. the logic under investigation: On the concept-level, each of the logics is characterised by an adapted form of bisimulation and simulation, respectively.#R##N##R##N# TBoxes of ALC, ALCI and ALCQ are characterised as fragments of FO which are invariant under global bisimulation and disjoint unions. The logics ALCO, ALCQO and ALCQIO, which incorporate individuals, are characterised w.r.t. to the class K of all interpretations which interpret individuals as singleton sets. #R##N##R##N#The characterisations for TBoxes of ALCO and ALCQO both require, additionally to being invariant under the appropriate notion of global bisimulation and an adapted version of disjoint unions, that an FO-sentence is, under certain circumstances, preserved under forward generated subinterpretations. #R##N##R##N#FO-sentences equivalent to ALCQIO-TBoxes, are - due to ALCQIO's inverse roles - characterised similarly to ALCO and ALCQO but have as third additional requirement that they are preserved under generated subinterpretations.#R##N##R##N#EL as sub-boolean DL is characterised on concept level as the FO-fragment which is preserved under simulation and preserved under direct products. Equally valid is the characterisation by being preserved under simulation and having minimal models. For EL-TBoxes, a global version of simulation was not sufficient but FO-sentences of EL-TBoxes are invariant under global equi-simulation, disjoint unions and direct products. #R##N##R##N#For each of these description logics, the characteristic concepts are explicated and the characterisation is accompanied by an investigation under which notion of saturation the logic in hand enjoys the Hennessy-and-Milner-Property.  #R##N##R##N#As application of the results we determine the minimal globally bisimilar companion w.r.t. ALCQO-bisimulation and introduce the L1-to-L2-rewritability problem for TBoxes, where L1 and L2 are (description) logics.  The latter is the problem to decide whether or not an L1-TBox can be equivalently expressed as L2-TBox. We give algorithms which decide ALCI-to-ALC-rewritability and ALC-to-EL-rewritability.

Includes members:
  Member "description logic tboxes model theoretic characterizations and rewritability":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dichotomies in ontology mediated querying with the guarded fragment")
  Member "hypertableau reasoning for description logics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "knowledge graphs")
  Member "arithmetic first order logic and counting quantifiers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reasoning about social choice and games in monadic fixed point logic")
  Member "complexity results and practical algorithms for logics in knowledge representation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "satisfiability and query answering in description logics with global and local cardinality constraints")
  Member "decidable reasoning in terminological knowledge representation systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "blocking and other enhancements for bottom up model generation methods")

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.LO(Logic in Computer Science)