Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

SciTaiL: A Textual Entailment Dataset from Science Question Answering

- Tushar Khot, A. Sabharwal, Peter Clark
- Computer Science
- AAAI
- 7 February 2018

We present a new dataset and model for textual entailment, derived from treating multiple-choice question-answering as an entailment problem. SCITAIL is the first entailment set that is created… Expand

Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge

- Peter Clark, Isaac Cowhey, +4 authors Oyvind Tafjord
- Computer Science
- ArXiv
- 14 March 2018

We present a new question set, text corpus, and baselines assembled to encourage AI research in advanced question answering. Together, these constitute the AI2 Reasoning Challenge (ARC), which… Expand

Towards Understanding and Harnessing the Potential of Clause Learning

- P. Beame, Henry A. Kautz, A. Sabharwal
- Computer Science
- J. Artif. Intell. Res.
- 1 July 2004

Effcient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problems, such as… Expand

Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering

- Todor Mihaylov, Peter Clark, Tushar Khot, A. Sabharwal
- Computer Science
- EMNLP
- 8 September 2018

We present a new kind of question answering dataset, OpenBookQA, modeled after open book exams for assessing human understanding of a subject. The open book that comes with our questions is a set of… Expand

Algorithm Selection and Scheduling

- Serdar Kadioglu, Y. Malitsky, A. Sabharwal, Horst Samulowitz, M. Sellmann
- Computer Science
- CP
- 12 September 2011

Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifying the most… Expand

Satisfiability Solvers

- Carla P. Gomes, Henry A. Kautz, A. Sabharwal, B. Selman
- Computer Science
- Handbook of Knowledge Representation
- 2008

Publisher Summary The past few years have seen enormous progress in the performance of Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known algorithms,… Expand

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization

- S. Ermon, Carla P. Gomes, A. Sabharwal, B. Selman
- Computer Science, Mathematics
- ICML
- 26 February 2013

Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives… Expand

Model Counting: A New Strategy for Obtaining Good Bounds

- Carla P. Gomes, A. Sabharwal, B. Selman
- Computer Science
- AAAI
- 16 July 2006

Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satisfiability, and hence… Expand

From Sampling to Model Counting

- Carla P. Gomes, J. Hoffmann, A. Sabharwal, B. Selman
- Computer Science
- IJCAI
- 6 January 2007

We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previous approaches, our… Expand

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering

- Y. Malitsky, A. Sabharwal, Horst Samulowitz, M. Sellmann
- Computer Science
- IJCAI
- 3 August 2013

Different solution approaches for combinatorial problems often exhibit incomparable performance that depends on the concrete problem instance to be solved. Algorithm portfolios aim to combine the… Expand