human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL( T )"):
  Abstract: We first introduce  Abstract DPLL , a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason about them in a simple way. Its properties, such as soundness, completeness or termination, immediately carry over to the modern DPLL implementations with features such as backjumping or clause learning.We then extend the framework to Satisfiability Modulo background Theories (SMT) and use it to model several variants of the so-called  lazy approach  for SMT. In particular, we use it to introduce a few variants of a new, efficient and modular approach for SMT based on a general DPLL( X ) engine, whose parameter  X  can be instantiated with a specialized solver  Solver   T   for a given theory  T , thus producing a DPLL( T ) system. We describe the high-level design of DPLL( X ) and its cooperation with  Solver   T  , discuss the role of  theory propagation , and describe different DPLL( T ) strategies for some theories arising in industrial applications.Our extensive experimental evidence, summarized in this article, shows that DPLL( T ) systems can significantly outperform the other state-of-the-art tools, frequently even in orders of magnitude, and have better scaling properties.

Includes members:
  Member "Potassco: The Potsdam Answer Set Solving Collection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "A system for the use of answer set programming in reinforcement learning")
  Member "Efficient conflict driven learning in a boolean satisfiability solver":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "A new approach to the maximum flow problem")
  Member "Lazy explanations for constraint propagators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "Learning When to Use Lazy Learning in Constraint Solving")
  Member "Volume Computation for Boolean Combination of Linear Arithmetic Constraints":
    also connected through other hyperedges:
      (none)
  Member "Abstract disjunctive answer set solvers":
    also connected through other hyperedges:
      (none)
  Member "There are no CNF problems":
    also connected through other hyperedges:
      (none)
  Member "Congruence closure of compressed terms in polynomial time":
    also connected through other hyperedges:
      (none)

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics