María Luisa Bonet Carbonell is a Spanish computer scientist interested in logic in computer science, including proof complexity and algorithms for the maximum satisfiability problem.
She is a professor of computer science at the Polytechnic University of Catalonia.
[2] She earned a master's degree in mathematics there in 1987,[3] and became a doctoral student of Samuel Buss, studying theoretical computer science.
[2] Buss moved to the University of California, San Diego in 1988,[4] but Bonet remained at Berkeley; her 1991 doctoral dissertation, The Lengths of Propositional Proofs and the Deduction Rule, listed both Buss and Leo Harrington as co-advisors.
She returned to Barcelona in 1996, to take a position in the computer science department of the Polytechnic University of Catalonia.