Advertisement

Abstract

The derivation process in SMS depends upon a host of functions that define crucial correspondences within the system. The approach used is to postulate a set of SL formalisms to be accessed in building the DB component. The mechan ics of proof depend in large measure upon the correspondences described in this section. The following notation will be used schematically to describe those correspondences:
  1. 1)

    the symbols’ sS, SS1, ..., SSn’ will continue to stand for sentence-sequences;

     
  2. 2)

    the symbols’ sf, sf1, ..., sfn’ will continue to stand for sentence-sequence formalisms;

     
  3. 3)

    the letter’ s’ will stand for the set of all well formed sentential sequences;

     
  4. 4)

    the letter ‘F’ will stand for the set of all well formed sentential formalisms.

     

Keywords

Causal Chain Original Query Direct Inference Sentential Formalism Position Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1991

Authors and Affiliations

  • Cary G. deBessonet
    • 1
    • 2
  1. 1.AI ProjectLouisiana State Law InstituteUSA
  2. 2.Southern UniversityUSA

Personalised recommendations