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: "There are no CNF problems"
  Abstract: SAT technology has improved rapidly in recent years, to the point now where it can solve CNF problems of immense size. But solving CNF problems ignores one important fact: there are NO problems that are originally CNF. All the CNF that SAT solvers tackle is the result of modelling some real world problem, and mapping the high-level constraints and decisions modelling the problem into clauses on binary variables. But by throwing away the high level view of the problem SAT solving may have lost a lot of important insight into how the problem is best solved. In this talk I will hope to persuade you that by keeping the original high level model of the problem one can realise immense benefits in solving hard real world problems.

Connected through hyperedge HE-1 (induced by source paper "Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL( T )"):
  with members:
    - "Potassco: The Potsdam Answer Set Solving Collection"
    - "Efficient conflict driven learning in a boolean satisfiability solver"
    - "Lazy explanations for constraint propagators"
    - "Volume Computation for Boolean Combination of Linear Arithmetic Constraints"
    - "Abstract disjunctive answer set solvers"
    - "Congruence closure of compressed terms in polynomial time"

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