human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems."
  Abstract: The sequential circuit state space diameter problem is an important problem in sequential verification. Bounded model checking is complete if the state space diameter of the system is known. By unrolling the transition relation, the sequential circuit state space diameter problem can be formulated as an evaluation for satisfiability of a Quantified Boolean Formula (QBF). This has prompted research in QBFs in the verification community. Most of existing QBF algorithms, such as those based on the DPLL SAT algorithm, are search based. We show that using search based QBF algorithms to calculate the state space diameter of sequential circuits with existing problem formulations is no better than an explicit state space enumeration method. This result holds independent of the representation of the QBF formula. This result is important as it highlights the need to explore non-search based or hybrid of search and non-search based QBF algorithms for the sequential circuit state space diameter problem.

Connected through hyperedge HE-1 (induced by source paper "Learning partially observable deterministic action models"):
  with members:
    - "Learning HTN method preconditions and action models from partial observations"

Connected through hyperedge HE-2 (induced by source paper "Formal Verification of Gate-Level Computer Systems"):
  with members:
    - "The Verisoft Approach to Systems Verification"

Connected through hyperedge HE-3 (induced by source paper "Efficient conflict driven learning in a boolean satisfiability solver"):
  with members:
    - "Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL( T )"
    - "Lazy explanations for constraint propagators"
    - "A new approach to the maximum flow problem"
    - "Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science