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”

'Knowing-That' vs. 'Knowing-wh'

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F23%3A10254643" target="_blank" >RIV/61989100:27240/23:10254643 - isvavai.cz</a>

  • Result on the web

    <a href="https://ebooks.iospress.nl/volumearticle/62725" target="_blank" >https://ebooks.iospress.nl/volumearticle/62725</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3233/FAIA220498" target="_blank" >10.3233/FAIA220498</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    'Knowing-That' vs. 'Knowing-wh'

  • Original language description

    Though there is a huge amount of the so-called epistemic logics that deal with propositional attitudes, i.e., sentences of the form &apos;a knows that P&apos;, their &apos;wh-cousins&apos; of the form &apos;a knows who is a P&apos;, &apos;a knows what the P is&apos;, &apos;a knows which Ps are Qs&apos;, etc., have been, to the best of my knowledge, almost neglected. A similar disproportion can be observed between the analysis of Yes-No questions, which has been under scrutiny of many erotetic logics, and Wh-questions which have been dealt with just by a few authors. To fill this gap, we have analysed Wh-questions in Transparent Intensional Logic (TIL) and adjusted Gentzen&apos;s system of natural deduction to TIL natural language processing; thus, our TIL question-Answering system can answer not only Yes-No questions but also derive answers to Wh-questions. In this paper, I am going to apply these results to the analysis of sentences containing a &apos;knowing-wh&apos; constituent. In addition, I will analyse the relation between &apos;knowing-That&apos; and &apos;knowing-wh&apos;. For instance, if a knows that the Mayor of Ostrava is Mr Macura, can we logically derive that a knows who is the Mayor of Ostrava? Or, vice versa, if a knows who is the Mayor of Ostrava and the Mayor of Ostrava is Mr Macura, do these assumptions logically entail that a knows that the Mayor of Ostrava is Mr Macura? Though in case of rational human agents the answers seem to be a no-doubt YES, perhaps a rather surprising answer is in general negative. We have to specify rules for deriving the relation between knowing-That and knowing-wh, and if a software agent is rational but resource bounded, it does not have to have in its ontology the rules necessary to derive the answer. The goal of the paper is the specification of these rules. Hence, when applying these results into the design of a multi-Agent system composed of software resource-bounded agents, we have to compute their inferable knowledge, which accounts not only for their explicit knowledge but also for their inferential abilities. (C) 2023 The authors and IOS Press.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2023

  • 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

  • ISBN

    978-1-64368-370-6

  • ISSN

    0922-6389

  • e-ISSN

  • Number of pages

    23

  • Pages from-to

    136-158

  • Publisher name

    IOS Press BV

  • Place of publication

    Amsterdam

  • Event location

    Hamburg

  • Event date

    May 30, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article