Knowledge

María Luisa Bonet

Source 📝

534: 129:. She returned to Barcelona in 1996, to take a position in the computer science department of the Polytechnic University of Catalonia. She became a full professor there in 2007. 529: 519: 524: 514: 103: 67: 117:
Bonet did postdoctoral research as a Warchawski Assistant Professor at the University of California, San Diego, at the
91: 316: 284: 421: 63: 470: 99: 118: 254: 217: 156: 55: 330: 394: 83: 509: 325: 94:. She earned a master's degree in mathematics there in 1987, and became a doctoral student of 148: 347: 307: 275: 238: 185: 314:
Ansótegui, Carlos; Bonet, María Luisa; Levy, Jordi (2013), "SAT-based MaxSAT algorithms",
8: 490: 44: 22: 247:"On the relative complexity of resolution refinements and cutting planes proof systems" 173: 87: 335: 293: 263: 246: 226: 209: 190: 165: 59: 21:
This article is about the Spanish computer scientist. For the Spanish singer, see
343: 339: 303: 298: 271: 234: 201: 181: 140: 38: 282:
Bonet, María Luisa; Levy, Jordi; Manyà, Felip (2007), "Resolution for Max-SAT",
494: 245:
Bonet, María Luisa; Esteban, Juan Luis; Galesi, Nicola; Johannsen, Jan (2000),
111: 443: 267: 230: 503: 466: 189:; preliminary version in 27th Symposium on Theory of Computing (STOC 1995), 351:; based on conference papers in SAT 2009, CCIA 2009, AAAI 2010, and CP 2012 29: 194: 106:
in 1988, but Bonet remained at Berkeley; her 1991 doctoral dissertation,
95: 177: 126: 79: 169: 485: 369: 205: 144: 33: 149:"Lower bounds for cutting planes proofs with small coefficients" 122: 244: 108:
The Lengths of Propositional Proofs and the Deduction Rule
535:
Academic staff of the Polytechnic University of Catalonia
210:"On interpolation and automatization for Frege systems" 313: 501: 66:. She is a professor of computer science at the 199: 138: 42: and the second or maternal family name is 281: 82:. After earning a degree in philosophy at the 54:is a Spanish computer scientist interested in 362: 530:University of California, Berkeley alumni 329: 297: 389: 387: 385: 383: 132: 73: 502: 380: 376:, Polytechnic University of Catalonia 416: 414: 436: 104:University of California, San Diego 68:Polytechnic University of Catalonia 13: 92:University of California, Berkeley 14: 546: 520:Spanish women computer scientists 479: 460: 411: 525:University of Barcelona alumni 64:maximum satisfiability problem 1: 471:Mathematics Genealogy Project 395:"María Luisa Bonet Carbonell" 355: 340:10.1016/j.artint.2013.01.002 299:10.1016/j.artint.2007.03.001 100:theoretical computer science 32:, the first or paternal 7: 515:Spanish computer scientists 374:Computer Science Department 52:María Luisa Bonet Carbonell 10: 551: 119:University of Pennsylvania 27: 20: 16:Spanish computer scientist 268:10.1137/S0097539799352474 255:SIAM Journal on Computing 231:10.1137/S0097539798353230 218:SIAM Journal on Computing 157:Journal of Symbolic Logic 78:Bonet is originally from 56:logic in computer science 493:publications indexed by 432:– via Docplayer.es 317:Artificial Intelligence 285:Artificial Intelligence 110:, listed both Buss and 84:University of Barcelona 62:and algorithms for the 86:in 1984, she became a 195:10.1145/225058.225275 133:Selected publications 200:Bonet, María Luisa; 139:Bonet, María Luisa; 102:. Buss moved to the 74:Education and career 23:Maria del Mar Bonet 450:, Simons Institute 401:, Simons Institute 491:María Luisa Bonet 467:María Luisa Bonet 542: 473: 464: 458: 457: 456: 455: 440: 434: 433: 431: 430: 423:Curriculum vitae 418: 409: 408: 407: 406: 391: 378: 377: 366: 350: 333: 310: 301: 292:(8–9): 606–618, 278: 262:(5): 1462–1484, 251: 241: 225:(6): 1939–1967, 214: 202:Pitassi, Toniann 188: 153: 141:Pitassi, Toniann 114:as co-advisors. 88:Fulbright Fellow 60:proof complexity 550: 549: 545: 544: 543: 541: 540: 539: 500: 499: 482: 477: 476: 465: 461: 453: 451: 442: 441: 437: 428: 426: 420: 419: 412: 404: 402: 393: 392: 381: 368: 367: 363: 358: 331:10.1.1.278.7791 249: 212: 170:10.2307/2275569 151: 135: 76: 49: 26: 17: 12: 11: 5: 548: 538: 537: 532: 527: 522: 517: 512: 498: 497: 495:Google Scholar 488: 481: 480:External links 478: 475: 474: 459: 435: 410: 379: 360: 359: 357: 354: 353: 352: 311: 279: 242: 197: 164:(3): 708–728, 134: 131: 112:Leo Harrington 75: 72: 15: 9: 6: 4: 3: 2: 547: 536: 533: 531: 528: 526: 523: 521: 518: 516: 513: 511: 510:Living people 508: 507: 505: 496: 492: 489: 487: 484: 483: 472: 468: 463: 449: 445: 439: 425: 424: 417: 415: 400: 396: 390: 388: 386: 384: 375: 371: 365: 361: 349: 345: 341: 337: 332: 327: 323: 319: 318: 312: 309: 305: 300: 295: 291: 287: 286: 280: 277: 273: 269: 265: 261: 257: 256: 248: 243: 240: 236: 232: 228: 224: 220: 219: 211: 207: 203: 198: 196: 192: 187: 183: 179: 175: 171: 167: 163: 159: 158: 150: 146: 142: 137: 136: 130: 128: 124: 120: 115: 113: 109: 105: 101: 97: 93: 89: 85: 81: 71: 69: 65: 61: 57: 53: 47: 46: 41: 40: 35: 31: 24: 19: 462: 452:, retrieved 447: 438: 427:, retrieved 422: 403:, retrieved 398: 373: 364: 321: 315: 289: 283: 259: 253: 222: 216: 161: 155: 116: 107: 77: 58:, including 51: 50: 43: 37: 30:Spanish name 18: 98:, studying 96:Samuel Buss 504:Categories 454:2023-03-14 444:"Sam Buss" 429:2023-03-14 405:2023-03-14 356:References 324:: 77–105, 127:New Jersey 486:Home page 326:CiteSeerX 121:, and at 80:Barcelona 45:Carbonell 370:"People" 208:(2000), 206:Raz, Ran 147:(1997), 145:Raz, Ran 28:In this 469:at the 348:3024193 308:2333554 276:1813959 239:1756400 186:1472120 178:2275569 90:at the 34:surname 448:People 399:People 346:  328:  306:  274:  237:  184:  176:  123:DIMACS 250:(PDF) 213:(PDF) 174:JSTOR 152:(PDF) 39:Bonet 336:doi 322:196 294:doi 290:171 264:doi 227:doi 191:doi 166:doi 125:in 36:is 506:: 446:, 413:^ 397:, 382:^ 372:, 344:MR 342:, 334:, 320:, 304:MR 302:, 288:, 272:MR 270:, 260:30 258:, 252:, 235:MR 233:, 223:29 221:, 215:, 204:; 182:MR 180:, 172:, 162:62 160:, 154:, 143:; 70:. 338:: 296:: 266:: 229:: 193:: 168:: 48:. 25:.

Index

Maria del Mar Bonet
Spanish name
surname
Bonet
Carbonell
logic in computer science
proof complexity
maximum satisfiability problem
Polytechnic University of Catalonia
Barcelona
University of Barcelona
Fulbright Fellow
University of California, Berkeley
Samuel Buss
theoretical computer science
University of California, San Diego
Leo Harrington
University of Pennsylvania
DIMACS
New Jersey
Pitassi, Toniann
Raz, Ran
"Lower bounds for cutting planes proofs with small coefficients"
Journal of Symbolic Logic
doi
10.2307/2275569
JSTOR
2275569
MR
1472120

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.