Grammatical unification (Q789185): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Initial Algebra Semantics and Continuous Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Natural language communication with computers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4051550 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Definite clause grammars for language analysis - A survey of the formalism and a comparison with augmented transition networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3864488 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Horn clause computability / rank | |||
Normal rank | |||
Latest revision as of 10:56, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Grammatical unification |
scientific article |
Statements
Grammatical unification (English)
0 references
1982
0 references
This paper presents a generalization of the concept of unification introduced by \textit{J. A. Robinson} [J. Assoc. Math. 12, 23-41 (1965; Zbl 0139.123)] for resolution logic. Unification is the central procedure for performing manipulation of symbolic structures in resolution theorem proving.
0 references
grammatical unification
0 references
context-free grammars
0 references
logic programming
0 references
Horn clause
0 references
Prolog systems
0 references
resolution logic
0 references
manipulation of symbolic structures
0 references
