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 "finite satisfiability of the two variable guarded fragment with transitive guards and related variants"):
  Abstract: We are concerned with extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, pre- or partial orders). We prove that the only fragment that retains the finite (exponential) model property is GF2 with equivalence guards when equality is not available in the signature. For remaining fragments we show that the size of a minimal finite model is at most doubly exponential. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NExpTime-upper bound on the complexity of the finite satisfiability problem for these fragments. We improve the bounds and obtain optimal ones for all the fragments considered, in particular NExpTime for GF2 with equivalence guards, and 2ExpTime for GF2 with transitive guards. To obtain our results we essentially use some results from integer programming.

Includes members:
  Member "query answering with transitive and linear ordered data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite satisfiability of unary negation fragment with transitivity")
  Member "order invariance of two variable logic is decidable":
    also connected through other hyperedges:
      (none)
  Member "combining existential rules and transitivity next steps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ontological multidimensional data models and contextual data qality")
  Member "two variable logic with two order relations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "synthesis of data word transducers")
  Member "satisfiability vs finite satisfiability in elementary modal logics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite model reasoning in expressive fragments of first order logic")
  Member "finite satisability for guarded fixpoint logic":
    also connected through other hyperedges:
      (none)
  Member "complexity of the guarded two variable fragment with counting quantifiers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ontology focusing knowledge enriched databases on demand")
  Member "complexity results and practical algorithms for logics in knowledge representation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "satisfiability and query answering in description logics with global and local cardinality constraints")

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)