Now showing items 1-4 of 4

    • Natural Language Based Inference Procedures Applied to Schubert's Steamroller 

      Givan, Robert; McAllester, David; Shalaby, Sameer (1991-12-01)
      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 Syntax and First Order Preference 

      McAllester, David; Givan, Robert (1989-10-01)
      We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides ...
    • Taxonomic Syntax for First-Order Inference 

      McAllester, David; Givan, Robert (1989-06-01)
      Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas ...
    • Tractable Inference Relations 

      Givan, Robert; McAllester, David (1991-12-01)
      We consider the concept of local sets of inference rules. Locality is a syntactic condition on rule sets which guarantees that the inference relation defined by those rules is polynomial time decidable. Unfortunately, ...