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: "interpolant based transition relation approximation"
  Abstract: In predicate abstraction, exact image computation is problematic, requiring#N#in the worst case an exponential number of calls to a decision procedure. For#N#this reason, software model checkers typically use a weak approximation of the#N#image. This can result in a failure to prove a property, even given an adequate#N#set of predicates. We present an interpolant-based method for strengthening the#N#abstract transition relation in case of such failures. This approach guarantees#N#convergence given an adequate set of predicates, without requiring an exact#N#image computation. We show empirically that the method converges more rapidly#N#than an earlier method based on counterexample analysis.

Connected through hyperedge HE-1 (induced by source paper "complexity and information in invariant inference"):
  with members:
    - "horn ice learning for synthesizing invariantsand contracts"
    - "learning disjunctions of predicates"
    - "interactive program synthesis"
    - "abstract learning frameworks for synthesis"
    - "a theory of formal synthesis via inductive learning"
    - "ic3 modulo theories via implicit predicate abstraction"
    - "abstract acceleration of general linear loops"
    - "tight bounds on proper equivalence query learning of dnf"

Connected through hyperedge HE-2 (induced by source paper "learning abstractions for program synthesis"):
  with members:
    - "program synthesis using abstraction refinement"
    - "synthesizing imperative programs from examples guided by static analysis"
    - "automated migration of hierarchical data to relational tables using programming by example"
    - "synthesis of data completion scripts using finite tree automata"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"
    - "sat based methods for circuit synthesis"

Connected through hyperedge HE-3 (induced by source paper "sharper and simpler nonlinear interpolants for program verification"):
  with members:
    - "interpolation synthesis for quadratic polynomial inequalities and combination with euf"
    - "generating non linear interpolants by semidefinite programming"
    - "interpolation properties and sat based model checking"
    - "barrier certificates revisited"

Connected through hyperedge HE-4 (induced by source paper "on interpolation and symbol elimination in theory extensions"):
  with members:
    - "a pspace complete first order fragment of computability logic"
    - "interpolation in local theory extensions"
    - "polynomial time computation via local inference relations"

Connected through hyperedge HE-5 (induced by source paper "resolution proof transformation for compression and interpolation"):
  with members:
    - "proof tree preserving interpolation"
    - "a scalable algorithm for minimal unsatisfiable core extraction"

Connected through hyperedge HE-6 (induced by source paper "generalised interpolation by solving recursion free horn clauses"):
  with members:
    - "efficient interpolant generation in satisfiability modulo linear integer arithmetic"

Connected through hyperedge HE-7 (induced by source paper "efficient generation of craig interpolants in satisfiability modulo theories"):
  with members:
    - "ground interpolation for the theory of equality"
    - "interpolation in local theory extensions"
    - "the octagon abstract domain"

Connected through hyperedge HE-8 (induced by source paper "automated predicate abstraction for real time models"):
  with members:
    - "predicate abstraction via symbolic decision procedures"

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)