Making a shift from believing to knowing by the help of RDF CFL formal representation
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F19%3AA2101Y5B" target="_blank" >RIV/61988987:17310/19:A2101Y5B - isvavai.cz</a>
Výsledek na webu
<a href="http://dx.doi.org/10.1007/978-3-319-75605-9_21" target="_blank" >http://dx.doi.org/10.1007/978-3-319-75605-9_21</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-75605-9_21" target="_blank" >10.1007/978-3-319-75605-9_21</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Making a shift from believing to knowing by the help of RDF CFL formal representation
Popis výsledku v původním jazyce
In the frame of seeking an optimal formal language means for semantic web inferences a model and language RDF CFL has been developed. Using an intensional approach to the language semantics in its graph-based style of representation a demand of open world has been fulfilled. On the other side the RDF CFL system contains a package of inference methods working especially in closed-worlds, that have been developed in the clausal form of first order predicate logics, useful for solving a lot of tasks over corresponding knowledge bases. The article shows one of the capabilities of our RDF CFL graph language using as an example a well-known Castaněda’s puzzle that has been before used by some authors of new formal approaches, like for example Shapiro’s SNaPS for testing their possibilities. The believing versus knowing problem accompanying the puzzle brings into a discussion a further dimension. © Springer International Publishing AG, part of Springer Nature 2019.
Název v anglickém jazyce
Making a shift from believing to knowing by the help of RDF CFL formal representation
Popis výsledku anglicky
In the frame of seeking an optimal formal language means for semantic web inferences a model and language RDF CFL has been developed. Using an intensional approach to the language semantics in its graph-based style of representation a demand of open world has been fulfilled. On the other side the RDF CFL system contains a package of inference methods working especially in closed-worlds, that have been developed in the clausal form of first order predicate logics, useful for solving a lot of tasks over corresponding knowledge bases. The article shows one of the capabilities of our RDF CFL graph language using as an example a well-known Castaněda’s puzzle that has been before used by some authors of new formal approaches, like for example Shapiro’s SNaPS for testing their possibilities. The believing versus knowing problem accompanying the puzzle brings into a discussion a further dimension. © Springer International Publishing AG, part of Springer Nature 2019.
Klasifikace
Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10200 - Computer and information sciences
Návaznosti výsledku
Projekt
—
Návaznosti
S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2019
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název statě ve sborníku
Lecture Notes in Electrical Engineering
ISBN
978-331975604-2
ISSN
1876-1100
e-ISSN
—
Počet stran výsledku
8
Strana od-do
148-155
Název nakladatele
Springer International Publishing AG
Místo vydání
Switzerland
Místo konání akce
Dubrovnik
Datum konání akce
27. 9. 2017
Typ akce podle státní příslušnosti
WRD - Celosvětová akce
Kód UT WoS článku
—