Reasoning in Fuzzy Graph-Based Clausal Form Logic

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F13%3AA13016WF" target="_blank" >RIV/61988987:17310/13:A13016WF - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Reasoning in Fuzzy Graph-Based Clausal Form Logic

Popis výsledku v původním jazyce

This paper follows the work of T. Richards specialization Clausal Form Logic (CFL) formal system of the first order logic. The paper presents also the way of using graph-based clausal form statements in the frame of fuzzy semantic networks. The goal of our research is to follow the direction towards graph-based clausal form knowledge representation shaped by Richards and build up a fuzzy graph-based formal system. The new formal system Fuzzy Graph-based Clausal Form Logic (FGCFL) has its own graph-basedlanguage with the expressivity similar to that one of CFL and enriched Fuzzy logic (implementation of fuzzy logic increases expressivity). The idea of the FGCFL graph-based approach is also useful in the frame of the fuzzy RDF model especially in its graph version.

Název v anglickém jazyce

Reasoning in Fuzzy Graph-Based Clausal Form Logic

Popis výsledku anglicky

This paper follows the work of T. Richards specialization Clausal Form Logic (CFL) formal system of the first order logic. The paper presents also the way of using graph-based clausal form statements in the frame of fuzzy semantic networks. The goal of our research is to follow the direction towards graph-based clausal form knowledge representation shaped by Richards and build up a fuzzy graph-based formal system. The new formal system Fuzzy Graph-based Clausal Form Logic (FGCFL) has its own graph-basedlanguage with the expressivity similar to that one of CFL and enriched Fuzzy logic (implementation of fuzzy logic increases expressivity). The idea of the FGCFL graph-based approach is also useful in the frame of the fuzzy RDF model especially in its graph version.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2013

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

Proceeding of 12th Conference on Applied Mathematics

ISBN

978-80-227-3865-1

ISSN

—

e-ISSN

—

Počet stran výsledku

12

Strana od-do

1-12

Název nakladatele

Slovak University of Technology in Bratislava, Publishing House of STU

Místo vydání

Bratislava

Místo konání akce

Bratislava, Slovenská republika

Datum konání akce

5. 2. 2013

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

EUR - Evropská akce

Kód UT WoS článku

—