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 "probabilistic logic many valuedness and intensionality"):
  Abstract: The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computation of probabilities and for reasoning about probabilities, with a well-defined syntax and semantics. Both current approaches, based on Nilsson's probability structures/logics, and on linear inequalities in order to reason about probabilities, have some weak points. In this paper we have presented the complete revision of both approaches. We have shown that the full embedding of Nilsson'probabilistic structure into propositional logic results in a truth-functional many-valued logic, differently from Nilsson's intuition and current considerations about propositional probabilistic logic. Than we have shown that the logic for reasoning about probabilities can be naturally embedded into a 2-valued intensional FOL with intensional abstraction, by avoiding current ad-hoc system composed of two different 2-valued logics: one for the classical propositional logic at lower-level, and a new one at higher-level for probabilistic constraints with probabilistic variables. The obtained theoretical results are applied to Probabilistic Logic Programming.

Includes members:
  Member "first order logic modality and intensionality":
    also connected through other hyperedges:
      (none)
  Member "a new representation theorem for many valued modal logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reduction of many valued into two valued modal logics")
  Member "temporal probabilistic logic programs state and revision":
    also connected through other hyperedges:
      (none)

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)