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: "logic programming with satisfiability"
  Abstract: This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT. To appear in Theory and Practice of Logic Programming (TPLP)

Connected through hyperedge HE-1 (induced by source paper "boolean equi propagation for concise and efficient sat encodings of combinatorial problems"):
  with members:
    - "compiling finite domain constraints to sat with bee"
    - "boolean equi propagation for optimized sat encoding"
    - "optimal base encodings for pseudo boolean constraints"
    - "circuit complexity and decompositions of global constraints"
    - "the alldifferent constraint a survey"

Connected through hyperedge HE-2 (induced by source paper "compiling finite domain constraints to sat with bee the director s cut"):
  with members:
    - "boolean equi propagation for concise and efficient sat encodings of combinatorial problems"
    - "compiling finite domain constraints to sat with bee"
    - "boolean equi propagation for optimized sat encoding"
    - "optimal base encodings for pseudo boolean constraints"

Connected through hyperedge HE-3 (induced by source paper "transfer function synthesis without quantifier elimination"):
  with members:
    - "automatic modular abstractions for template numerical constraints"
    - "automatic modular abstractions for linear constraints"
    - "accelerated data flow analysis"
    - "the octagon abstract domain"
    - "a static analyzer for large safety critical software"

Connected through hyperedge HE-4 (induced by source paper "compiling finite domain constraints to sat with bee"):
  with members:
    - "boolean equi propagation for optimized sat encoding"

Connected through hyperedge HE-5 (induced by source paper "redalert determinacy inference for prolog"):
  with members:
    - "automated termination analysis for logic programs with cut"

Connected through hyperedge HE-6 (induced by source paper "solving partial order constraints for lpo termination"):
  with members:
    - "sat solving for argument filterings"
    - "sat techniques for lexicographic path orders"
    - "satisfying kbo constraints"
    - "boolean satisfiability with transitivity constraints"

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.PL(Programming Languages)