Advertisement

What Are Logic Grammars?

  • Harvey Abramson
  • Veronica Dahl
Part of the Symbolic Computation book series (SYMBOLIC)

Abstract

Logic grammars can be thought of as ordinary grammars in the sense of formal language theory, in that they comprise generalized type-0 rewriting rules-rules of the form: “rewrite α into β,” noted:
$$\alpha \to \beta $$
where α and β are strings of terminals and nonterminals. A terminal indicates a word in the input sequence. A sequence of terminals takes the form of a Prolog list. Nonterminals indicate constituents. In this text, they take the form of a Prolog structure, where the functor names the category of the constituent and the arguments give information like number class, meaning etc.

Keywords

Linguistic Research Procedure Call Rule Application Grammar Rule Terminal Symbol 
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

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Harvey Abramson
    • 1
  • Veronica Dahl
    • 2
  1. 1.Department of Computer ScienceUniversity of BristolBristolEngland
  2. 2.Department of Computer ScienceSimon Fraser UniversityBurnabyCanada

Personalised recommendations