Reasoning in Formal Systems of Extended RDF Networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F17%3AA1801N0Q" target="_blank" >RIV/61988987:17310/17:A1801N0Q - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-54430-4_36" target="_blank" >http://dx.doi.org/10.1007/978-3-319-54430-4_36</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-54430-4_36" target="_blank" >10.1007/978-3-319-54430-4_36</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Reasoning in Formal Systems of Extended RDF Networks

Popis výsledku v původním jazyce

It is a fact that the RDF(S) model has been declared as the ground base for implementations of further web development conception. RDF provides a common and flexible way to decompose knowledge to elementary statements that allows, as networks of indivisible knowledge atoms, to be represented by RDF triples or by RDF graph vectors.The article presents two graph based formal systems GRDF and RDFCFL defined on the base of extended RDF model with the help of clausal form logic principle and notation. The transformation process from the first order predicate logics (FOPL) to the RDF graph notation protects language expressivity and moreover both the presented systems share the partial decidability with the FOPL. As an example it is shown a reasoning of consequents in a monotonic version of the RDFCFL system.

Název v anglickém jazyce

Reasoning in Formal Systems of Extended RDF Networks

Popis výsledku anglicky

It is a fact that the RDF(S) model has been declared as the ground base for implementations of further web development conception. RDF provides a common and flexible way to decompose knowledge to elementary statements that allows, as networks of indivisible knowledge atoms, to be represented by RDF triples or by RDF graph vectors.The article presents two graph based formal systems GRDF and RDFCFL defined on the base of extended RDF model with the help of clausal form logic principle and notation. The transformation process from the first order predicate logics (FOPL) to the RDF graph notation protects language expressivity and moreover both the presented systems share the partial decidability with the FOPL. As an example it is shown a reasoning of consequents in a monotonic version of the RDFCFL system.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

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ů

Název statě ve sborníku

Intelligent Information and Database Systems

ISBN

978-3-319-54430-4

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

10

Strana od-do

371-381

Název nakladatele

Springer Verlag

Místo vydání

Switzerland

Místo konání akce

Kanazawa, JAPAN

Datum konání akce

3. 4. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000401653300036