human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "chr prism based probabilistic logic learning"
  Abstract: PRISM is an extension of Prolog with probabilistic predicates and built-in support for expectation-maximization learning. Constraint Handling Rules (CHR) is a high-level programming language based on multi-headed multiset rewrite rules.#R##N##R##N#In this paper, we introduce a new probabilistic logic formalism, called  CHRiSM , based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models by means of “chance rules”. The underlying PRISM system can then be used for several probabilistic inference tasks, including probability computation and parameter learning. We define the  CHRiSM  language in terms of syntax and operational semantics, and illustrate it with examples. We define the notion of ambiguous programs and define a distribution semantics for unambiguous programs. Next, we describe an implementation of  CHRiSM , based on CHR(PRISM). We discuss the relation between  CHRiSM  and other probabilistic logic programming languages, in particular PCHR. Finally, we identify potential application domains.

Connected through hyperedge HE-1 (induced by source paper "a labelling framework for probabilistic argumentation"):
  with members:
    - "formulating semantics of probabilistic argumentation by characterizing subgraphs theory and empirical results"
    - "probabilistic argumentation an equational approach"
    - "probabilistic argumentation with epistemic extensions and incomplete information"
    - "afra argumentation framework with recursive attacks"

Connected through hyperedge HE-2 (induced by source paper "an operational semantics for the cognitive architecture act r and its translation to constraint handling rules"):
  with members:
    - "confluence modulo equivalence with invariants in constraint handling rules"
    - "on proving confluence modulo equivalence for constraint handling rules"
    - "a decidable confluence test for cognitive models in act r"
    - "exchanging conflict resolution in an adaptable implementation of act r"

Connected through hyperedge HE-3 (induced by source paper "confluence and convergence in probabilistically terminating reduction systems"):
  with members:
    - "on proving confluence modulo equivalence for constraint handling rules"
    - "infinite probability computation by cyclic explanation graphs"

Connected through hyperedge HE-4 (induced by source paper "unfolding for chr programs"):
  with members:
    - "transformations of ccp programs"

Question: Please tell me which class the center node 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.PL(Programming Languages)