Natural Language Based Inference Procedures Applied to Schubert's Steamroller

Abstract

We have previously argued that the syntactic structure of natural language can be exploited to construct powerful polynomial time inference procedures. This paper supports the earlier arguments by demonstrating that a natural language based polynomial time procedure can solve Schubert's steamroller in a single step.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1991
Accession Number
ADA259603

Entities

People

  • David Mcallester
  • Robert Givan
  • Sameer Shalaby

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Animals
  • Artificial Intelligence
  • Artificial Intelligence Computing
  • Continents
  • Contracts
  • Control Systems
  • Formal Languages
  • Language
  • Lepidoptera
  • Military Research
  • Natural Languages
  • Polynomials
  • Reasoning
  • Semantics
  • Standards
  • User Interface

Readers

  • Calculus or Mathematical Analysis
  • Computational Linguistics

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Machine Translation