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 "hypertableau reasoning for description logics"):
  Abstract: We present a novel reasoning calculus for the description logic SHOIQ+--a knowledge representation formalism with applications in areas such as the SemanticWeb. Unnecessary nondeterminism and the construction of large models are two primary sources of inefficiency in the tableau-based reasoning calculi used in state-of-the-art reasoners. In order to reduce nondeterminism, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination. In order to reduce the size of the constructed models, we introduce anywhere pairwise blocking. We also present an improved nominal introduction rule that ensures termination in the presence of nominals, inverse roles, and number restrictions--a combination of DL constructs that has proven notoriously difficult to handle. Our implementation shows significant performance improvements over state-of-the-art reasoners on several well-known ontologies.

Includes members:
  Member "blocking and other enhancements for bottom up model generation methods":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using tableau to decide description logics with full role negation and identity")
  Member "deciding regular grammar logics with converse through first order logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of graded modal logics with converse")
  Member "complexity results and practical algorithms for logics in knowledge representation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "satisfiability and query answering in description logics with global and local cardinality constraints")
  Member "the complexity of reasoning with cardinality restrictions and nominals in expressive description logics":
    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 "reasoning with individuals for the description logic shiq":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "conjunctive query answering via a fragment of set theory extended version")
  Member "decidable reasoning in terminological knowledge representation systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)