Search Results for author:
Found 4 papers, 2 papers with code
Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learning
Text-based reinforcement learning agents have predominantly been neural network-based models with embeddings-based representation, learning uninterpretable policies that often do not generalize well to unseen games.
A Benchmark for Generalizable and Interpretable Temporal Question Answering over Knowledge Bases
Specifically, our benchmark is a temporal question answering dataset with the following advantages: (a) it is based on Wikidata, which is the most frequently curated, openly available knowledge base, (b) it includes intermediate sparql queries to facilitate the evaluation of semantic parsing based approaches for KBQA, and (c) it generalizes to multiple knowledge bases: Freebase and Wikidata.
SYGMA: System for Generalizable Modular Question Answering OverKnowledge Bases
In addition, to demonstrate extensi-bility to additional reasoning types we evaluate on multi-hopreasoning datasets and a new Temporal KBQA benchmarkdataset on Wikidata, namedTempQA-WD1, introduced in thispaper.
The TechQA Dataset
We introduce TechQA, a domain-adaptation question answering dataset for the technical support domain.
