default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTushar Khot
- > Home > Persons > Tushar Khot
Publications
- 2024
[c61]Harsh Trivedi, Tushar Khot, Mareike Hartmann, Ruskin Manku, Vinty Dong, Edward Li, Shashank Gupta, Ashish Sabharwal, Niranjan Balasubramanian:
AppWorld: A Controllable World of Apps and People for Benchmarking Interactive Coding Agents. ACL (1) 2024: 16022-16076- [i46]Harsh Trivedi, Tushar Khot, Mareike Hartmann, Ruskin Manku, Vinty Dong, Edward Li, Shashank Gupta, Ashish Sabharwal, Niranjan Balasubramanian:
AppWorld: A Controllable World of Apps and People for Benchmarking Interactive Coding Agents. CoRR abs/2407.18901 (2024) - 2023
- [c57]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions. ACL (1) 2023: 10014-10037 - 2022
- [j8]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
♫ MuSiQue: Multihop Questions via Single-hop Question Composition. Trans. Assoc. Comput. Linguistics 10: 539-554 (2022) - [c51]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
Teaching Broad Reasoning Skills for Multi-Step QA by Generating Hard Contexts. EMNLP 2022: 6541-6566 - [i37]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
Teaching Broad Reasoning Skills via Decomposition-Guided Contexts. CoRR abs/2205.12496 (2022) - [i32]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions. CoRR abs/2212.10509 (2022) - 2021
- [i27]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
MuSiQue: Multi-hop Questions via Single-hop Question Composition. CoRR abs/2108.00573 (2021) - 2020
- [c38]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
Is Multihop QA in DiRe Condition? Measuring and Reducing Disconnected Reasoning. EMNLP (1) 2020: 8846-8863 - [i21]Harsh Trivedi, Niranjan Balasubramanian, Tushar Khot, Ashish Sabharwal:
Measuring and Reducing Non-Multifact Reasoning in Multi-hop Question Answering. CoRR abs/2005.00789 (2020) - 2019
- [c35]Harsh Trivedi, Heeyoung Kwon, Tushar Khot, Ashish Sabharwal, Niranjan Balasubramanian:
Repurposing Entailment for Multi-Hop Question Answering Tasks. NAACL-HLT (1) 2019: 2948-2958 - [i14]Harsh Trivedi, Heeyoung Kwon, Tushar Khot, Ashish Sabharwal, Niranjan Balasubramanian:
Repurposing Entailment for Multi-Hop Question Answering Tasks. CoRR abs/1904.09380 (2019) - 2015
- [c17]Tushar Khot, Niranjan Balasubramanian, Eric Gribkoff, Ashish Sabharwal, Peter Clark, Oren Etzioni:
Exploring Markov Logic Networks for Question Answering. EMNLP 2015: 685-694 - [i1]Tushar Khot, Niranjan Balasubramanian, Eric Gribkoff, Ashish Sabharwal, Peter Clark, Oren Etzioni:
Markov Logic Networks for Natural Language Question Answering. CoRR abs/1507.03045 (2015)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
