LAMBADA: Backward Chaining for Automated Reasoning in Natural Language

By Seyed Mehran Kazemi, Najoung Kim, Deepti Bhatia, Xinyuan Xu, Deepak Ramachandran. 2022

105 citations recorded by the source corpus.

Remarkable progress has been made on automated reasoning with natural text, by using Large Language Models (LLMs) and methods such as Chain-of-Thought prompting and Selection-Inference. These techniques search for proofs in the forward direction from axioms to the conclusion, which suffers from a combinatorial explosion of the search space, and thus high failure rates for problems requiring longer chains of reasoning. The classical automated reasoning literature has shown that reasoning in the backward direction (i.e. from intended conclusion to supporting axioms) is significantly more efficient at proof-finding. Importing this intuition into the LM setting, we develop a Backward Chaining algorithm, called LAMBADA, that decomposes reasoning into four sub-modules, that are simply implemented by few-shot prompted LLM inference. We show that LAMBADA achieves sizable accuracy boosts over state-of-the-art forward reasoning methods on two challenging logical reasoning datasets, particularly when deep and accurate proof chains are required.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Timo Schick
  3. Luke S. Zettlemoyer
  4. Hinrich Schütze
  5. Thomas Scialom
  6. Yejin Choi
  7. Asli Celikyilmaz
  8. Jianfeng Gao

In Natural Language Processing

  1. Timo Schick
  2. Asli Celikyilmaz
  3. Thomas Scialom
  4. Hinrich Schütze
  5. Edouard Grave
  6. Maria Lomeli
  7. Yejin Choi
  8. Jane Dwivedi-Yu

Citations in the corpus