`Travelled to:`

1 × Finland

1 × Germany

1 × Portugal

2 × Austria

2 × United Kingdom

3 × Canada

3 × Italy

4 × USA

`Collaborated with:`

A.Goultiaeva H.Samulowitz ∅ R.P.A.Petrick N.Narodytska G.Katsirelos J.Davies J.Winter A.J.Grove V.Iverson C.Thiffault T.Walsh J.D.Tenenberg J.A.G.M.Koomen K.Fazekas A.Biere A.Legg L.Ryzhyk A.Walker H.Mangassarian B.Le A.G.Veneris T.Sang P.Beame H.A.Kautz T.Pitassi

`Talks about:`

qbf (6) solv (4) algorithm (3) base (3) set (3) preprocess (2) incomplet (2) knowledg (2) exploit (2) circuit (2)

## Person: Fahiem Bacchus

### DBLP: Bacchus:Fahiem

### Facilitated 1 volumes:

### Contributed to:

### Wrote 21 papers:

- CAV-2015-BacchusK #satisfiability #set #using
- Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets (FB, GK), pp. 70–86.
- CAV-2014-NarodytskaLBRW #game studies
- Solving Games without Controllable Predecessor (NN, AL, FB, LR, AW), pp. 533–540.
- SAT-2014-BacchusN #algorithm #analysis #satisfiability
- Cores in Core Based MaxSat Algorithms: An Analysis (FB, NN), pp. 7–15.
- SAT-2013-DaviesB #power of #satisfiability
- Exploiting the Power of mip Solvers in maxsat (JD, FB), pp. 166–181.
- SAT-2013-GoultiaevaB
- Recovering and Utilizing Partial Duality in QBF (AG, FB), pp. 83–99.
- SAT-2012-GoultiaevaB #algorithm
- Off the Trail: Re-examining the CDCL Algorithm (AG, FB), pp. 30–43.
- DATE-2010-MangassarianLGVB #preprocessor
- Leveraging dominators for preprocessing QBF (HM, BL, AG, AGV, FB), pp. 1695–1700.
- SAT-2010-GoultiaevaB
- Exploiting Circuit Representations in QBF Solving (AG, FB), pp. 333–339.
- SAT-2009-GoultiaevaIB
- Beyond CNF: A Circuit-Based QBF Solver (AG, VI, FB), pp. 412–426.
- SAT-2007-SamulowitzB #clustering
- Dynamically Partitioning for Solving QBF (HS, FB), pp. 215–229.
- SAT-2006-Bacchus #named #satisfiability
- CSPs: Adding Structure to SAT (FB), p. 10.
- SAT-2006-SamulowitzB #reasoning
- Binary Clause Reasoning in QBF (HS, FB), pp. 353–367.
- KR-2004-PetrickB #approach #knowledge-based
- Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing (RPAP, FB), pp. 613–622.
- SAT-2004-SangBBKP #component #effectiveness #learning
- Combining Component Caching and Clause Learning for Effective Model Counting (TS, FB, PB, HAK, TP), pp. 20–28.
- SAT-2004-ThiffaultBW
- Solving Non-clausal Formulas with DPLL search (CT, FB, TW), pp. 147–156.
- SAT-2003-BacchusW #effectiveness #preprocessor #reduction #similarity
- Effective Preprocessing with Hyper-Resolution and Equality Reduction (FB, JW), pp. 341–355.
- SAT-2002-Bacchus #reasoning #trade-off
- Exploring the computational tradeoff of more reasoning and less searching (FB), p. 34.
- KR-1998-BacchusP #execution #information management #modelling
- Modeling an Agent’s Incomplete Knowledge During Planning and During Execution (FB, RPAP), pp. 432–443.
- KR-1996-BacchusG #independence
- Utility Independence in a Qualitative Decision Theory (FB, AJG), pp. 542–552.
- KR-1989-BacchusTK #logic
- A Non-Reified Temporal Logic (FB, JDT, JAGMK), pp. 2–10.
- IJCAR-2018-FazekasBB #algorithm #modulo theories #satisfiability #set
- Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories (KF, FB, AB), pp. 134–151.