human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "team building with answer set programming in the gioia tauro seaport"
  Abstract: (To appear in Theory and Practice of Logic Programming (TPLP).) #R##N#The seaport of Gioia Tauro is the largest transshipment terminal of the Mediterranean coast. A crucial management task for the companies operating in the seaport is team building: the problem of properly allocating the available personnel for serving the incoming ships. Teams have to be carefully arranged in order to meet several constraints, such as allocation of the employees with the appropriate skills, fair distribution of the working load, and turnover of the heavy/dangerous roles. This makes team building a hard and expensive task requiring several hours per day of manual preparation. #R##N#In this paper we present a system based on Answer Set Programming (ASP) for the automatic generation of the teams of employees in the seaport of Gioia Tauro. The system is currently exploited in the Gioia Tauro seaport by ICO BLG, a company specialized in automobile logistics.

Connected through hyperedge HE-1 (induced by source paper "efficiently coupling the i dlv grounder with asp solvers"):
  with members:
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "anytime answer set optimization via unsatisfiable core shrinking"
    - "asperix a first order forward chaining approach for answer set computing"
    - "predicate logic as a modeling language modeling and solving some machine learning and data mining problems with idp3"
    - "a multi engine approach to answer set programming"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "satzilla portfolio based algorithm selection for sat"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-2 (induced by source paper "inconsistency proofs for asp the asp drupe format"):
  with members:
    - "asp core 2 input language format"
    - "shared aggregate sets in answer set programming"
    - "routing driverless transport vehicles in car assembly with answer set programming"
    - "textsf qrat generalizing qrat by a more powerful qbf redundancy property"
    - "efficient certified rat verification"
    - "vicious circle principle and logic programs with aggregates"
    - "detecting inconsistencies in large biological networks with answer set programming"
    - "trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs"

Connected through hyperedge HE-3 (induced by source paper "exploiting partial knowledge in declarative domain specific heuristics for asp"):
  with members:
    - "the seventh answer set programming competition design and results"
    - "degrees of laziness in grounding effects of lazy grounding strategies on asp solving"
    - "combining answer set programming and domain heuristics for solving hard industrial problems application paper"
    - "asperix a first order forward chaining approach for answer set computing"
    - "clingo asp control preliminary report"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "logic programs with propositional connectives and aggregates"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-4 (induced by source paper "solving a flowshop scheduling problem with answer set programming exploiting the problem to reduce the number of combinations"):
  with members:
    - "routing driverless transport vehicles in car assembly with answer set programming"

Connected through hyperedge HE-5 (induced by source paper "answering the why in answer set programming a survey of explanation approaches"):
  with members:
    - "achievements in answer set programming"
    - "enablers and inhibitors in causal justifications of logic programs"
    - "stepwise debugging of answer set programs"
    - "justifications for programs with disjunctive and causal choice rules"
    - "deriving conclusions from non monotonic cause effect relations"
    - "an integrated graphical user interface for debugging answer set programs"
    - "justifying answer sets using argumentation"
    - "asperix a first order forward chaining approach for answer set computing"

Connected through hyperedge HE-6 (induced by source paper "logic programming applications what are the abstractions and implementations"):
  with members:
    - "applp a dialogue on applications of logic programming"
    - "precise complexity guarantees for pointer analysis via datalog with extensions"
    - "the founded semantics and constraint semantics of logic rules"
    - "demand driven incremental object queries"
    - "xsb extending prolog with tabled logic programming"
    - "fo fd extending classical logic with rule based fixpoint definitions"
    - "the dlv system for knowledge representation and reasoning"

Connected through hyperedge HE-7 (induced by source paper "disjunctive answer set solvers via templates"):
  with members:
    - "transition systems for model generators a unifying approach"
    - "the dlv system for knowledge representation and reasoning"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-8 (induced by source paper "dual normal logic programs the forgotten class"):
  with members:
    - "backdoors to normality for disjunctive logic programs"
    - "trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs"
    - "characterising equilibrium logic and nested logic programs reductions and complexity1 2"
    - "semantical characterizations and complexity of equivalences in answer set programming"
    - "unfolding partiality and disjunctions in stable model semantics"

Question: Please tell me which class the center node 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)