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 "querying guarded fragments via resolution"):
  Abstract: The problem of answering Boolean conjunctive queries over the guarded fragment is decidable, however, as yet no practical decision procedure exists. In this paper, we present a resolution-based decision procedure to address this problem, and further extend the decision procedure to the loosely guarded fragment. In particular, we show that using a separation rule and top-variable-based techniques, one can rewrite Boolean conjunctive queries into a set of (loosely) guarded clauses, so that querying the (loosely) guarded fragment can be reduced to deciding the (loosely) guarded fragment. As far as we know, this is the first practical decision procedure for answering Boolean conjunctive queries over the guarded fragment and the loosely guarded fragment.

Includes members:
  Member "deciding the loosely guarded fragment and querying its horn fragment using resolution":
    also connected through other hyperedges:
      (none)
  Member "querying the guarded fragment":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite open world query answering with number restrictions")
  Member "hypertree decompositions and tractable queries":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity analysis of general and fractional hypertree decompositions")

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)