<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="pratt-hartmann-2014-relational">
    <titleInfo>
        <title>The Relational Syllogistic Revisited</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Ian</namePart>
        <namePart type="family">Pratt-Hartmann</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2014</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Linguistic Issues in Language Technology</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>CSLI Publications</publisher>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>The relational syllogistic is an extension of the language of Classical syllogisms in which predicates are allowed to feature transitive verbs with quantified objects. It is known that the relational syllogistic does not admit a finite set of syllogism-like rules whose associated (direct) derivation relation is sound and complete. We present a modest extension of this language which does.</abstract>
    <identifier type="citekey">pratt-hartmann-2014-relational</identifier>
    <location>
        <url>https://aclanthology.org/2014.lilt-9.8</url>
    </location>
    <part>
        <date>2014</date>
        <detail type="volume"><number>9</number></detail>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T The Relational Syllogistic Revisited
%A Pratt-Hartmann, Ian
%J Linguistic Issues in Language Technology
%D 2014
%V 9
%I CSLI Publications
%F pratt-hartmann-2014-relational
%X The relational syllogistic is an extension of the language of Classical syllogisms in which predicates are allowed to feature transitive verbs with quantified objects. It is known that the relational syllogistic does not admit a finite set of syllogism-like rules whose associated (direct) derivation relation is sound and complete. We present a modest extension of this language which does.
%U https://aclanthology.org/2014.lilt-9.8

Markdown (Informal)

[The Relational Syllogistic Revisited](https://aclanthology.org/2014.lilt-9.8) (Pratt-Hartmann, LILT 2014)

• The Relational Syllogistic Revisited (Pratt-Hartmann, LILT 2014)

ACL

• Ian Pratt-Hartmann. 2014. The Relational Syllogistic Revisited. Linguistic Issues in Language Technology, 9.