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 "a new expert questioning approach to more efficient fault localization in ontologies"):
  Abstract: When ontologies reach a certain size and complexity, faults such as inconsistencies, unsatisfiable classes or wrong entailments are hardly avoidable. Locating the incorrect axioms that cause these faults is a hard and time-consuming task. Addressing this issue, several techniques for semi-automatic fault localization in ontologies have been proposed. Often, these approaches involve a human expert who provides answers to system-generated questions about the intended (correct) ontology in order to reduce the possible fault locations. To suggest as informative questions as possible, existing methods draw on various algorithmic optimizations as well as heuristics. However, these computations are often based on certain assumptions about the interacting user. #R##N#In this work, we characterize and discuss different user types and show that existing approaches do not achieve optimal efficiency for all of them. As a remedy, we suggest a new type of expert question which aims at fitting the answering behavior of all analyzed experts. Moreover, we present an algorithm to optimize this new query type which is fully compatible with the (tried and tested) heuristics used in the field. Experiments on faulty real-world ontologies show the potential of the new querying method for minimizing the expert consultation time, independent of the expert type. Besides, the gained insights can inform the design of interactive debugging tools towards better meeting their users' needs.

Includes members:
  Member "are query based ontology debuggers really helping knowledge engineers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "a generally applicable highly scalable measurement computation and optimization approach to sequential model based diagnosis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "inexpensive cost optimized measurement proposal for sequential model based diagnosis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "towards better response times and higher quality queries in interactive knowledge base debugging":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "interactive debugging of knowledge bases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "rio minimizing user interaction in ontology debugging":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")
  Member "interactive ontology debugging two query strategies for efficient fault localization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "understanding the quickxplain algorithm simple explanation and formal proof")

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.AI(Artificial Intelligence)