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 "rethinking defeasible reasoning a scalable approach"):
  Abstract: Recent technological advances have led to unprecedented amounts of generated data that originate from the Web, sensor networks and social media. Analytics in terms of defeasible reasoning - for example for decision making - could provide richer knowledge of the underlying domain. Traditionally, defeasible reasoning has focused on complex knowledge structures over small to medium amounts of data, but recent research efforts have attempted to parallelize the reasoning process over theories with large numbers of facts. Such work has shown that traditional defeasible logics come with overheads that limit scalability. In this work, we design a new logic for defeasible reasoning, thus ensuring scalability by design. We establish several properties of the logic, including its relation to existing defeasible logics. Our experimental results indicate that our approach is indeed scalable and defeasible reasoning can be applied to billions of facts.

Includes members:
  Member "annotated defeasible logic":
    also connected through other hyperedges:
      (none)
  Member "efficient computation of the well founded semantics over big data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scaling up reasoning and advanced analytics on bigdata")
  Member "computing strong and weak permissions in defeasible logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the rationale behind the concept of goal")
  Member "relative expressiveness of defeasible logics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "annotated defeasible logic")
  Member "propositional defeasible logic has linear complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "applications of linear defeasible logic combining resource consumption and exceptions to energy management and business processes")
  Member "representation results for defeasible logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "applications of linear defeasible logic combining resource consumption and exceptions to energy management and business processes")
  Member "a flexible framework for defeasible logics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enabling reasoning with legalruleml")

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)