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 "enablers and inhibitors in causal justifications of logic programs"):
  Abstract: To appear in Theory and Practice of Logic Programming (TPLP). In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-founded model is associated to a justification represented as an algebraic expression. This expression contains both causal explanations (in the form of proof graphs built with rule labels) and terms under the scope of negation that stand for conditions that enable or disable the application of causal rules. Using some examples, we discuss how these new conditions, we respectively call "enablers" and "inhibitors", are intimately related to default negation and have an essentially different nature from regular cause-effect relations. The most important result is a formal comparison to the recent algebraic approaches for justifications in LP: "Why-not Provenance" (WnP) and "Causal Graphs" (CG). We show that the current approach extends both WnP and CG justifications under the Well-Founded Semantics and, as a byproduct, we also establish a formal relation between these two approaches.

Includes members:
  Member "justifying answer sets using argumentation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "debugging non ground asp programs technique and graphical tools")
  Member "causal graph justifications of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a rule based system for explainable donor patient matching in liver transplantation")
  Member "actual causation in cp logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "justifications for programs with disjunctive and causal choice rules")
  Member "catching the ouroboros on debugging non ground answer set programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "debugging non ground asp programs technique and graphical tools")
  Member "actual causation and the art of modeling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "causality control flow")
  Member "defaults and normality in causal structures":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "causality control flow")
  Member "justifications for logic programs under answer set semantics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "debugging non ground asp programs technique and graphical tools")
  Member "stable models and an alternative logic programming paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the seventh answer set programming competition design and results")

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)