Knowing and/or believing a think: Deriving knowledge using RDF CFL

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F19%3AA210212D" target="_blank" >RIV/61988987:17310/19:A210212D - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-030-21507-1_10" target="_blank" >http://dx.doi.org/10.1007/978-3-030-21507-1_10</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-21507-1_10" target="_blank" >10.1007/978-3-030-21507-1_10</a>

Result language

angličtina

Original language name

Knowing and/or believing a think: Deriving knowledge using RDF CFL

Original language description

From the web discussion on a difference between knowing and believing, we have chosen in this paper the statements fulfilling enough our seeing the topic, corresponding to our knowledge level of cognitive science. The aim of paper shows one of the capabilities of our Resource Description Framework Clausal Form Logic (RDF CFL) graph language using as an example a well- known Castaněda's puzzle. RDF CFL is an appropriate tool that contains a package of inference methods working especially in closed-worlds that have been developed in the clausal form of first order predicate logics.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2019

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

Lecture Notes in Electrical Engineering

ISBN

978-303021506-4

ISSN

1876-1100

e-ISSN

—

Number of pages

6

Pages from-to

68-73

Publisher name

Springer Verlag

Place of publication

—

Event location

Dubrovnik, Croatia

Event date

Sep 26, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—