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: "automating induction for solving horn clauses"
  Abstract: Verification problems of programs written in various paradigms (such as imperative, logic, concurrent, functional, and object-oriented ones) can be reduced to problems of solving Horn clause constraints on predicate variables that represent unknown inductive invariants. This paper presents a novel Horn constraint solving method based on inductive theorem proving: the method reduces Horn constraint solving to validity checking of first-order formulas with inductively defined predicates, which are then checked by induction on the derivation of the predicates. To automate inductive proofs, we introduce a novel proof system tailored to Horn constraint solving and use an SMT solver to discharge proof obligations arising in the proof search. The main advantage of the proposed method is that it can verify relational specifications across programs in various paradigms where multiple function calls need to be analyzed simultaneously. The class of specifications includes practically important ones such as functional equivalence, associativity, commutativity, distributivity, monotonicity, idempotency, and non-interference. Furthermore, our novel combination of Horn clause constraints with inductive theorem proving enables us to naturally and automatically axiomatize recursive functions that are possibly non-terminating, non-deterministic, higher-order, exception-raising, and over non-inductively defined data types. We have implemented a relational verification tool for the OCaml functional language based on the proposed method and obtained promising results in preliminary experiments.

Connected through hyperedge HE-1 (induced by source paper "specification and inference of trace refinement relations"):
  with members:
    - "datalog based scalable semantic diffing of concurrent programs"
    - "verifying equivalence of database driven applications"
    - "kleene algebra modulo theories"
    - "symbolic algorithms for language equivalence and kleene algebra with tests"
    - "a temporal logic for hyperproperties"
    - "kleene algebra with domain"

Connected through hyperedge HE-2 (induced by source paper "lemma generation for horn clause satisfiability a preliminary study"):
  with members:
    - "proving properties of sorting programs a case study in horn clause verification"
    - "solving horn clauses on inductive data types without induction"
    - "predicate pairing for program verification"
    - "proving correctness of imperative programs by linearizing constrained horn clauses"

Connected through hyperedge HE-3 (induced by source paper "relational cost analysis for functional imperative programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "bidirectional type checking for relational properties"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "effect dependent transformations for concurrent programs"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "linear dependent types and relative completeness"
    - "abstract effects and proof relevant logical relations"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-4 (induced by source paper "solving horn clauses on inductive data types without induction"):
  with members:
    - "predicate pairing for program verification"
    - "proving correctness of imperative programs by linearizing constrained horn clauses"
    - "automatic abstraction in smt based unbounded software model checking"
    - "verification of java bytecode using analysis and transformation of logic programs"
    - "the parma polyhedra library toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems"

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)