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 "the joy of implications aka pure horn functions mainly a survey"):
  Abstract: Apart from a brief look at applications (Relational Databases, Formal Concept Analysis, data mining) this article is devoted to the mathematical t h e o r y of implications (=pure Horn formulas). It is mainly a survey of results obtained in the last thirty years, but features a few novelties as well. Some keywords: The Duquenne-Guiges (implicational) base, the canonical direct base, prime implicates, the consensus method, implications and meet irreducible closed sets, optimum bases for certain lattices, ordered direct bases, generating all closed sets, general (i.e. impure) Horn functions. We pose four open problems to stimulate further research.

Includes members:
  Member "hardness results for approximate pure horn cnf formulae minimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating minimum representations of key horn functions")
  Member "efficient algorithms for dualizing large scale hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi hop byzantine reliable broadcast with honest dealer made practical")
  Member "redundancy deduction schemes and minimum size bases for association rules":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sld resolution reduction of second order horn fragments technical report")
  Member "redundancy deduction schemes and minimum size bases for association rules":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sld resolution reduction of second order horn fragments technical report")

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)