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 "better paracoherent answer sets with less resources"):
  Abstract: Answer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions. Albeit the non-existence of answer sets for some ASP programs can be considered as a modeling feature, it turns out to be a weakness in many other cases, and especially for query answering. Paracoherent answer set semantics extend the classical semantics of ASP to draw meaningful conclusions also from incoherent programs, with the result of increasing the range of applications of ASP. State of the art implementations of paracoherent ASP adopt the semi-equilibrium semantics, but cannot be lifted straightforwardly to compute efficiently the (better) split semi-equilibrium semantics that discards undesirable semi-equilibrium models. In this paper an efficient evaluation technique for computing a split semi-equilibrium model is presented. An experiment on hard benchmarks shows that better paracoherent answer sets can be computed consuming less computational resources than existing methods. Under consideration for acceptance in TPLP.

Includes members:
  Member "on the computation of paracoherent answer sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the seventh answer set programming competition design and results")
  Member "multi shot asp solving with clingo":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "selp a single shot epistemic logic program solver")
  Member "query answering in resource based answer set semantics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "about epistemic negation and world views in epistemic logic programs")
  Member "combining answer set programming and domain heuristics for solving hard industrial problems application paper":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the external interface for extending wasp")
  Member "anytime answer set optimization via unsatisfiable core shrinking":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers")
  Member "improved answer set programming encodings for abstract argumentation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "design and results of the second international competition on computational models of argumentation")
  Member "on the tractability of minimal model computation for some cnf theories":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the computation of paracoherent answer sets")
  Member "the dlv system for knowledge representation and reasoning":
    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)