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 "abstract solvers for computing cautious consequences of asp programs"):
  Abstract: Abstract solvers are a method to formally analyze algorithms that have been profitably used for describing, comparing and composing solving techniques in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP. In this paper, we design, implement and test novel abstract solutions for cautious reasoning tasks in ASP. We show how to improve the current abstract solvers for cautious reasoning in ASP with new techniques borrowed from backbone computation in SAT, in order to design new solving algorithms. By doing so, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. We implement some of the new solutions in the ASP solver WASP and show that their performance are comparable to state-of-the-art solutions on the benchmark problems from the past ASP Competitions. Under consideration for acceptance in TPLP.

Includes members:
  Member "cautious reasoning in asp via minimal models and unsatisfiable cores":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing magic sets with an application to ontological reasoning")
  Member "anytime answer set optimization via unsatisfiable core shrinking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "anytime computation of cautious consequences in answer set programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enhancing magic sets with an application to ontological reasoning")
  Member "the third open answer set programming competition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the seventh answer set programming competition design and results")
  Member "transition systems for model generators a unifying approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on relation between constraint answer set programming and satisfiability modulo theories")
  Member "consistent query answering via asp from different perspectives theory and practice":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the external interface for extending wasp")
  Member "the dlv system for knowledge representation and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the seventh answer set programming competition design and results")
  Member "flux a logic programming method for reasoning agents":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "better paracoherent answer sets with less resources")

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)