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 "deriving conclusions from non monotonic cause effect relations"):
  Abstract: We present an extension of Logic Programming (under stable models semantics) that, not only allows concluding whether a true atom is a cause of another atom, but also deriving new conclusions from these causal-effect relations. This is expressive enough to capture informal rules like "if some agent's actions $\mathcal{A}$ have been necessary to cause an event $E$ then conclude atom $caused(\mathcal{A},E)$," something that, to the best of our knowledge, had not been formalised in the literature. To this aim, we start from a first attempt that proposed extending the syntax of logic programs with so-called causal literals. These causal literals are expressions that can be used in rule bodies and allow inspecting the derivation of some atom $A$ in the program with respect to some query function $\phi$. Depending on how these query functions are defined, we can model different types of causal relations such as sufficient, necessary or contributory causes, for instance. The initial approach was specifically focused on monotonic query functions. This was enough to cover sufficient cause-effect relations but, unfortunately, necessary and contributory are essentially non-monotonic. In this work, we define a semantics for non-monotonic causal literals showing that, not only extends the stable model semantics for normal logic programs, but also preserves many of its usual desirable properties for the extended syntax. Using this new semantics, we provide precise definitions of necessary and contributory causal relations and briefly explain their behaviour on a pair of typical examples from the Knowledge Representation literature. (Under consideration for publication in Theory and Practice of Logic Programming)

Includes members:
  Member "enablers and inhibitors in causal justifications of logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "answering the why in answer set programming a survey of explanation approaches")
  Member "justifications for programs with disjunctive and causal choice rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "answering the why in answer set programming a survey of explanation approaches")
  Member "justifying answer sets using argumentation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-5 (induced by source paper "enablers and inhibitors in causal justifications of logic programs")
  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")

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)