All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Logic of Dynamic Discourse; Anaphora Resolution

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10239117" target="_blank" >RIV/61989100:27240/18:10239117 - isvavai.cz</a>

  • Result on the web

    <a href="http://ebooks.iospress.nl/publication/48570" target="_blank" >http://ebooks.iospress.nl/publication/48570</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3233/978-1-61499-834-1-263" target="_blank" >10.3233/978-1-61499-834-1-263</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Logic of Dynamic Discourse; Anaphora Resolution

  • Original language description

    A method for computing the complete meaning of sentences with anaphoric reference is presented, that is, the method for implementing the substitution of an appropriate antecedent to accompany the anaphoric reference. Our method is similar to the one applied in general by Hans Kamp&apos;s Discourse Representation Theory (DRT). &apos;DRT&apos; is an umbrella term for a collection of logical and computational linguistic methods developed for a dynamic interpretation of natural language, where each sentence is interpreted within a certain discourse, which is a sequence of sentences uttered by a group of speakers. Interpretation conditions are given via instructions for updating the discourse representation. Yet these methods are mostly based on first-order logics. Thus, only expressions denoting individuals (indefinite or definite noun phrases) can introduce so-called discourse referents, which are free variables that are updated when interpreting the discourse. Our background theory is Pavel Tichý&apos;s Transparent Intensional Logic with its procedural rather than set-theoretic model semantics. Since our semantics is procedural, hence hyperintensional and higher-order, not only individuals, but entities of any type, like properties of individuals, propositions and hyperpropositions, relations-in-intension, and even constructions (i.e., meanings of antecedent expressions), can be linked to anaphoric variables. Moreover, the thoroughgoing typing of the universe of TIL makes it possible to determine the respective type-theoretically appropriate antecedent, which is one of the novel contributions of this paper. The second novelty is the specification of the algorithm for dynamic discourse representation within TIL.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA15-13277S" target="_blank" >GA15-13277S: Hyperintensional logic for natural language analysis</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Frontiers in Artificial Intelligence and Applications. Volume 301

  • ISBN

    978-1-61499-833-4

  • ISSN

    0922-6389

  • e-ISSN

    1879-8314

  • Number of pages

    17

  • Pages from-to

    263-279

  • Publisher name

    IOS Press

  • Place of publication

    Amsterodam

  • Event location

    Krabi

  • Event date

    Jun 5, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article