OU Portal
Log In
Welcome
Applicants
Z6_60GI02O0O8IDC0QEJUJ26TJDI4
Error:
Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.
{}
Close
Publikační činnost
Probíhá načítání, čekejte prosím...
publicationId :
tempRecordId :
actionDispatchIndex :
navigationBranch :
pageMode :
tabSelected :
isRivValid :
Record type:
stať ve sborníku (D)
Home Department:
Katedra informatiky a počítačů (31400)
Title:
Knowing and/or believing a think: Deriving knowledge using RDF CFL
Citace
Žáček, M., Lukasová, A. a Raunigr, P. Knowing and/or believing a think: Deriving knowledge using RDF CFL.
In:
3rd International Conference on Applied Physics, System Science and Computers, APSAC 2018: Lecture Notes in Electrical Engineering 2018-09-26 Dubrovnik, Croatia.
Springer Verlag, 2019. s. 68-73. ISBN 978-303021506-4.
Subtitle
Publication year:
2019
Obor:
Informatika
Number of pages:
6
Page from:
68
Page to:
73
Form of publication:
Elektronická verze
ISBN code:
978-303021506-4
ISSN code:
1876-1100
Proceedings title:
Lecture Notes in Electrical Engineering
Proceedings:
Mezinárodní
Publisher name:
Springer Verlag
Place of publishing:
neuvedeno
Country of Publication:
Název konference:
3rd International Conference on Applied Physics, System Science and Computers, APSAC 2018
Místo konání konference:
Dubrovnik, Croatia
Datum zahájení konference:
Typ akce podle státní
příslušnosti účastníků:
Celosvětová akce
WoS code:
EID:
2-s2.0-85068603727
Key words in English:
Resource Description Framework, RDF, logic puzzle, first order logic, CFL, knowing, believing, deriving
Annotation in original language:
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.
Annotation in english language:
References
Reference
R01:
RIV/61988987:17310/19:A210212D
Complementary Content
Deferred Modules
${title}
${badge}
${loading}
Deferred Modules