No label defined (Q4946228)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1421199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1421199 |
Statements
19 November 2000
0 references
underspecified logic
0 references
lexical functional grammar
0 references
Montague grammar
0 references
minimal recursion semantics
0 references
quasi logical forms
0 references
underspecified discourse representation structures
0 references
generalized modus ponens
0 references
computational linguistics
0 references
linear logic
0 references
0.765407383441925
0 references
0.7480751872062683
0 references
The first aim of the paper is to present a new formalism, called UL (Underspecified Logic), that extends some of the important existing underspecified representation languages used currently in computational linguistics. UL consists of a pair of a proper underspecified semantic representation language \(L\), and a deductive component that operates directly on these structures. A second purpose of the paper is to discuss and compare the properties of several formalisms such as the linear logic approach to LFG (Lexical Functional Grammar), MG (Montague Grammar), MRS (Minimal Recursion Semantics), QLF (Quasi Logical Forms), UDRS (Underspecified Discourse Representation Structures), and USDL. Section 1 presents these natural language representation formalisms and compare their significant logic properties, e.g. to be semantic, closed, complete, proper, c-deductive, u-deductive, cu-deductive, etc. Section 2 of the paper exposes the formal syntax and the logical language of the proposed UL formalism, comprising the underspecified formulae and the rule of Generalized Modus Ponens (GMP). Section 3 shows how UL may be instantiated on LFG, MG, MRS, QLF, UDRS, and USDL formalisms. Section 4 examines the negation in the context of the inference rule. The final Section 5 discusses possible extensions of the UL properties. For the entire collection see [Zbl 0927.00010].
0 references