Logic of Inferable Knowledge

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F17%3A86098470" target="_blank" >RIV/61989100:27240/17:86098470 - isvavai.cz</a>

Result on the web

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

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Logic of Inferable Knowledge

Original language description

Intensional epistemic logics are not apt for handling properly the specification of communication and reasoning of resource-bounded agents in a multi-agent system. They oscillate between two unrealistic extremes: either the explicit knowledge of an ‘idiot’ agent, deprived of any inferential capabilities, or the implicit knowledge of an agent who is a logical/mathematical genius. The goal of this paper is to introduce the notion of inferable knowledge of a rational yet resource-bounded agent. The stock of inferable knowledge of such an agent a is the closure of a chain-of-knowledge sequence validly derivable from a’s existing stock of explicit knowledge via one or more rules of inference that a masters. We are using Pavel Tichý’s Transparent Intensional Logic as our framework. This logic models knowing as a relation-in-intension between an agent and a construction (a hyperintensional mode of presentation of a possible-world proposition) rather than a set of possible worlds or a piece of syntax. We motivate the restriction of the epistemic closure principle to inferable knowledge, present the theoretical framework, define the concept of inferable knowledge, and explain the technicalities of the so restricted closure principle.

Czech name

—

Czech description

—

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)

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)

Publication year

2017

Confidentiality

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

Article name in the collection

Frontiers in Artificial Intelligence and Applications, vol. 292

ISBN

978-1-61499-719-1

ISSN

—

e-ISSN

neuvedeno

Number of pages

21

Pages from-to

405-425

Publisher name

IOS Press

Place of publication

Amsterodam

Event location

Tampere

Event date

Jun 6, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000402391600030