Ashish Sabharwal

Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz: Stronger Inference through Implied Literals from Conflicts and Knapsack Covers. CPAIOR 2013: 1-11

Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman: Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization. CoRR abs/1302.6677 (2013)

Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann: Parallel SAT Solver Selection and Scheduling. CP 2012: 512-526

Ashish Sabharwal, Horst Samulowitz, Chandra Reddy: Guiding Combinatorial Optimization with UCT. CPAIOR 2012: 356-361

Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman: Density Propagation and Improved Bounds on the Partition Function. NIPS 2012: 2771-2779

Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat: SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation). SAT 2012: 463-468

Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann: Learning Back-Clauses in SAT - (Poster Presentation). SAT 2012: 498-499

Arie Matsliah, Ashish Sabharwal, Horst Samulowitz: Augmenting Clause Learning with Implied Literals - (Poster Presentation). SAT 2012: 500-501

Daniel Sheldon, Bistra N. Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan: Maximizing the Spread of Cascades Using Network Design. CoRR abs/1203.3514 (2012)

Raghuram Ramanujan, Ashish Sabharwal, Bart Selman: Understanding Sampling Style Adversarial Search Methods. CoRR abs/1203.4011 (2012)

Lukas Kroc, Ashish Sabharwal, Bart Selman: Survey Propagation Revisited. CoRR abs/1206.5273 (2012)

Ashish Sabharwal, Bart Selman: S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition. Artif. Intell. 175(5-6): 935-937 (2011)

Lukas Kroc, Ashish Sabharwal, Bart Selman: Leveraging belief propagation, backtrack search, and statistics for model counting. Annals OR 184(1): 209-231 (2011)

Siddhartha Jain, Ashish Sabharwal, Meinolf Sellmann: A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT. AAAI 2011

Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann: Algorithm Selection and Scheduling. CP 2011: 454-469

Ronan LeBras, Theodoros Damoulas, John M. Gregoire, Ashish Sabharwal, Carla P. Gomes, R. Bruce van Dover: Constraint Reasoning and Kernel Clustering for Pattern Decomposition with Scaling. CP 2011: 508-522

Stefano Ermon, Carla P. Gomes, Ashish Sabharwal, Bart Selman: Accelerated Adaptive Markov Chain for Partition Function Computation. NIPS 2011: 2744-2752

Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann: Non-Model-Based Algorithm Portfolios for SAT. SAT 2011: 369-370

Paul Beame, Henry A. Kautz, Ashish Sabharwal: Towards Understanding and Harnessing the Potential of Clause Learning. CoRR abs/1107.0044 (2011)

David W. Aha, Mark S. Boddy, Vadim Bulitko, Artur S. d'Avila Garcez, Prashant Doshi, Stefan Edelkamp, Christopher W. Geib, Piotr J. Gmytrasiewicz, Robert P. Goldman, Pascal Hitzler, Charles L. Isbell, Darsana P. Josyula, Leslie Pack Kaelbling, Kristian Kersting, Maithilee Kunda, Luís C. Lamb, Bhaskara Marthi, Keith McGreggor, Vivi Nastase, Gregory Provan, Anita Raja, Ashwin Ram, Mark O. Riedl, Stuart J. Russell, Ashish Sabharwal, Jan-Georg Smaus, Gita Sukthankar, Karl Tuyls, Ron van der Meyden, Alon Y. Halevy, Lilyana Mihalkova, Sriraam Natarajan: Reports of the AAAI 2010 Conference Workshops. AI Magazine 31(4): 95-108 (2010)

Ethan Kim, Ashish Sabharwal, Adrian Vetta, Mathieu Blanchette: Predicting direct protein interactions from affinity purification mass spectrometry data. Algorithms for Molecular Biology 5: 34 (2010)

Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee: Floodlight illumination of infinite wedges. Comput. Geom. 43(1): 23-34 (2010)

Lukas Kroc, Ashish Sabharwal, Bart Selman: Approximate Inference for Clusters in Solution Spaces. Abstraction, Reformulation, and Approximation 2010

Gregory Provan, Ashish Sabharwal: Preface. Abstraction, Reformulation, and Approximation 2010

Raghuram Ramanujan, Ashish Sabharwal, Bart Selman: On Adversarial Search Spaces and Sampling-Based Planning. ICAPS 2010: 242-245

Kiyan Ahmadizadeh, Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: An Empirical Study of Optimization for Maximizing Diffusion in Networks. CP 2010: 514-521

Lukas Kroc, Ashish Sabharwal, Bart Selman: An Empirical Study of Optimal Noise and Runtime Distributions in Local Search. SAT 2010: 346-351

Raghuram Ramanujan, Ashish Sabharwal, Bart Selman: Understanding Sampling Style Adversarial Search Methods. UAI 2010: 474-483

Daniel Sheldon, Bistra N. Dilkina, Adam N. Elmachtoub, Ryan Finseth, Ashish Sabharwal, Jon Conrad, Carla P. Gomes, David B. Shmoys, William Allen, Ole Amundsen, William Vaughan: Maximizing the Spread of Cascades Using Network Design. UAI 2010: 517-526

Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal: New filtering algorithms for combinations of among constraints. Constraints 14(2): 273-292 (2009)

Ashish Sabharwal: SymChaff: exploiting symmetry in a structure-aware satisfiability solver. Constraints 14(4): 478-505 (2009)

Carmel Domshlak, Jörg Hoffmann, Ashish Sabharwal: Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings. J. Artif. Intell. Res. (JAIR) 36: 415-469 (2009)

Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann: Backdoors to Combinatorial Optimization: Feasibility and Optimality. CPAIOR 2009: 56-70

Lukas Kroc, Ashish Sabharwal, Carla P. Gomes, Bart Selman: Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT. IJCAI 2009: 544-551

Lukas Kroc, Ashish Sabharwal, Bart Selman: Message-passing and local heuristics as decimation strategies for satisfiability. SAC 2009: 1408-1414

Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: Backdoors in the Context of Learning. SAT 2009: 73-79

Lukas Kroc, Ashish Sabharwal, Bart Selman: Relaxed DPLL Search for MaxSAT. SAT 2009: 447-452

Henry A. Kautz, Ashish Sabharwal, Bart Selman: Incomplete Algorithms. Handbook of Satisfiability 2009: 185-203

Carla P. Gomes, Ashish Sabharwal: Exploiting Runtime Variation in Complete Solvers. Handbook of Satisfiability 2009: 271-288

Carla P. Gomes, Ashish Sabharwal, Bart Selman: Model Counting. Handbook of Satisfiability 2009: 633-654

Lukas Kroc, Ashish Sabharwal, Bart Selman: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. CPAIOR 2008: 127-141

Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal: Connections in Networks: A Hybrid Approach. CPAIOR 2008: 303-307

Willem Jan van Hoeve, Ashish Sabharwal: Filtering Atmost1 on Pairs of Set Variables. CPAIOR 2008: 382-386

Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: Tradeoffs in Backdoors: Inconsistency Detection, Dynamic Simplification, and Preprocessing. ISAIM 2008

Lukas Kroc, Bart Selman, Ashish Sabharwal: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. ISAIM 2008

Lukas Kroc, Ashish Sabharwal, Bart Selman: Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. NIPS 2008: 873-880

Paul Beame, Russell Impagliazzo, Ashish Sabharwal: The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs. Computational Complexity 16(3): 245-297 (2007)

Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: The Impact of Network Topology on Pure Nash Equilibria in Graphical Games. AAAI 2007: 42-49

Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Bart Selman: Counting CSP Solutions Using Generalized XOR Constraints. AAAI 2007: 204-209

Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: Tradeoffs in the Complexity of Backdoor Detection. CP 2007: 256-270

Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Jordan Suter: Connections in Networks: Hardness of Feasibility Versus Optimality. CPAIOR 2007: 16-28

Matthew Cary, Atri Rudra, Ashish Sabharwal: Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. ICALP 2007: 949

Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: From Sampling to Model Counting. IJCAI 2007: 2293-2299

Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Short XORs for Model Counting: From Theory to Practice. SAT 2007: 100-106

Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Sampling and Soundness: Can We Have Both? New Forms of Reasoning for the Semantic Web 2007

Lukas Kroc, Ashish Sabharwal, Bart Selman: Survey Propagation Revisited. UAI 2007: 217-226

Carla P. Gomes, Ashish Sabharwal, Bart Selman: Model Counting: A New Strategy for Obtaining Good Bounds. AAAI 2006: 54-61

Jörg Hoffmann, Ashish Sabharwal, Carmel Domshlak: Friends or Foes? An AI Planning Perspective on Abstraction and Search. ICAPS 2006: 294-303

Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal: Revisiting the Sequence Constraint. CP 2006: 620-634

Carla P. Gomes, Ashish Sabharwal, Bart Selman: Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. NIPS 2006: 481-488

Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. SAT 2006: 382-395

Ashish Sabharwal: SymChaff: A Structure-Aware Satisfiability Solver. AAAI 2005: 467-474

Matthew Cary, Atri Rudra, Ashish Sabharwal: On the Hardness of Embeddings Between Two Finite Metrics. ICALP 2005: 1412-1423

Paul Beame, Henry A. Kautz, Ashish Sabharwal: Towards Understanding and Harnessing the Potential of Clause Learning. J. Artif. Intell. Res. (JAIR) 22: 319-351 (2004)

Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. 34(2): 261-276 (2004)

Paul Beame, Henry A. Kautz, Ashish Sabharwal: Understanding the Power of Clause Learning. IJCAI 2003: 1194-1201

Ashish Sabharwal, Paul Beame, Henry A. Kautz: Using Problem Structure for Efficient Clause Learning. SAT 2003: 242-256

Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS 2002: 583-592

Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-depth Frege lower bounds for weaker pigeonhole principles. Electronic Colloquium on Computational Complexity (ECCC)(023) (2002)

Paul Beame, Russell Impagliazzo, Ashish Sabharwal: Resolution Complexity of Independent Sets in Random Graphs. IEEE Conference on Computational Complexity 2001: 52-68