#### Filter Results:

- Full text PDF available (88)

#### Publication Year

1995

2019

- This year (13)
- Last 5 years (42)
- Last 10 years (91)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paul Beame, Henry A. Kautz, Ashutosh Sabharwal
- J. Artif. Intell. Res.
- 2004

Efficient 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â€¦ (More)

- Tushar Khot, Ashutosh Sabharwal, Peter Clark
- AAAI
- 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â€¦ (More)

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â€¦ (More)

- Carla P. Gomes, Ashutosh Sabharwal, Bart Selman
- AAAI
- 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â€¦ (More)

- Carla P. Gomes, Ashutosh Sabharwal, Bart Selman
- NIPS
- 2006

We propose a new technique for sampling the solutions of combinatorial problems in a near-uniform manner. We focus on problems specified as a Boolean formula, i.e., on SAT instances. Sampling for SATâ€¦ (More)

- Stefano Ermon, Carla P. Gomes, Ashutosh Sabharwal, Bart Selman
- ICML
- 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â€¦ (More)

- Carla P. Gomes, Henry A. Kautz, Ashutosh Sabharwal, Bart Selman
- Handbook of Knowledge Representation
- 2008

The past few years have seen an enormous progress in the performance of Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known algorithms, satisfiabilityâ€¦ (More)

- Carla P. Gomes, JÃ¶rg Hoffmann, Ashutosh Sabharwal, Bart Selman
- IJCAI
- 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â€¦ (More)

- Peter Clark, Isaac Cowhey, +4 authors Oyvind Tafjord
- ArXiv
- 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â€¦ (More)

- Daniel Khashabi, Tushar Khot, Ashutosh Sabharwal, Peter Clark, Oren Etzioni, Dan Roth
- IJCAI
- 2016

Answering science questions posed in natural language is an important AI challenge. Answering such questions often requires non-trivial inference and knowledge that goes beyond factoid retrieval.â€¦ (More)