<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="collard-2018-finite">
    <titleInfo>
        <title>Finite State Reasoning for Presupposition Satisfaction</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Jacob</namePart>
        <namePart type="family">Collard</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-08</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the First International Workshop on Language Cognition and Computational Models</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Manjira</namePart>
            <namePart type="family">Sinha</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Tirthankar</namePart>
            <namePart type="family">Dasgupta</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Santa Fe, New Mexico, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Sentences with presuppositions are often treated as uninterpretable or unvalued (neither true nor false) if their presuppositions are not satisfied. However, there is an open question as to how this satisfaction is calculated. In some cases, determining whether a presupposition is satisfied is not a trivial task (or even a decidable one), yet native speakers are able to quickly and confidently identify instances of presupposition failure. I propose that this can be accounted for with a form of possible world semantics that encapsulates some reasoning abilities, but is limited in its computational power, thus circumventing the need to solve computationally difficult problems. This can be modeled using a variant of the framework of finite state semantics proposed by Rooth (2017). A few modifications to this system are necessary, including its extension into a three-valued logic to account for presupposition. Within this framework, the logic necessary to calculate presupposition satisfaction is readily available, but there is no risk of needing exceptional computational power. This correctly predicts that certain presuppositions will not be calculated intuitively, while others can be easily evaluated.</abstract>
    <identifier type="citekey">collard-2018-finite</identifier>
    <location>
        <url>https://aclanthology.org/W18-4106</url>
    </location>
    <part>
        <date>2018-08</date>
        <extent unit="page">
            <start>53</start>
            <end>62</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Finite State Reasoning for Presupposition Satisfaction
%A Collard, Jacob
%Y Sinha, Manjira
%Y Dasgupta, Tirthankar
%S Proceedings of the First International Workshop on Language Cognition and Computational Models
%D 2018
%8 August
%I Association for Computational Linguistics
%C Santa Fe, New Mexico, USA
%F collard-2018-finite
%X Sentences with presuppositions are often treated as uninterpretable or unvalued (neither true nor false) if their presuppositions are not satisfied. However, there is an open question as to how this satisfaction is calculated. In some cases, determining whether a presupposition is satisfied is not a trivial task (or even a decidable one), yet native speakers are able to quickly and confidently identify instances of presupposition failure. I propose that this can be accounted for with a form of possible world semantics that encapsulates some reasoning abilities, but is limited in its computational power, thus circumventing the need to solve computationally difficult problems. This can be modeled using a variant of the framework of finite state semantics proposed by Rooth (2017). A few modifications to this system are necessary, including its extension into a three-valued logic to account for presupposition. Within this framework, the logic necessary to calculate presupposition satisfaction is readily available, but there is no risk of needing exceptional computational power. This correctly predicts that certain presuppositions will not be calculated intuitively, while others can be easily evaluated.
%U https://aclanthology.org/W18-4106
%P 53-62

Markdown (Informal)

[Finite State Reasoning for Presupposition Satisfaction](https://aclanthology.org/W18-4106) (Collard, LCCM 2018)

• Finite State Reasoning for Presupposition Satisfaction (Collard, LCCM 2018)

ACL

• Jacob Collard. 2018. Finite State Reasoning for Presupposition Satisfaction. In Proceedings of the First International Workshop on Language Cognition and Computational Models, pages 53–62, Santa Fe, New Mexico, USA. Association for Computational Linguistics.