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 "reduction of many valued into two valued modal logics"):
  Abstract: In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation types, where we explicitly introduce the coexistence of a set of algebraic truth values of original many-valued logic, transformed as parameters (or possible worlds), and the set of classic two logic values. This approach is close to the approach used in annotated logics, but offers the possibility of using the standard semantics based on Herbrand interpretations. Moreover, it uses the properties of the higher-order Herbrand types, as their fundamental nature is based on autoreferential Kripke semantics where the possible worlds are algebraic truth-values of original many-valued logic. This autoreferential Kripke semantics, which has the possibility of flattening higher-order Herbrand interpretations into ordinary 2-valued Herbrand interpretations, gives us a clearer insight into the relationship between many-valued and 2-valued multi-modal logics. This methodology is applied to the class of many-valued Logic Programs, where reduction is done in a structural way, based on the logic structure (logic connectives) of original many-valued logics. Following this, we generalize the reduction to general structural many-valued logics, in an abstract way, based on Suszko's informal non-constructive idea. In all cases, by using developed 2-valued reductions we obtain a kind of non truth-valued modal meta-logics, where two-valued formulae are modal sentences obtained by application of particular modal operators to original many-valued formulae.

Includes members:
  Member "on paraconsistent weakening of intuitionistic negation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binary sequent calculi for truth invariance entailment of finite many valued logics")
  Member "a new representation theorem for many valued modal logics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic logic many valuedness and intensionality")
  Member "binary sequent calculi for truth invariance entailment of finite many valued logics":
    also connected through other hyperedges:
      (none)
  Member "on a theory of probabilistic deductive databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probabilistic dl reasoning with pinpointing formulas a prolog based approach")

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)