Reasoning in RDFgraphic formal system with quantifier
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F10%3AA1500YJV" target="_blank" >RIV/61988987:17310/10:A1500YJV - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Reasoning in RDFgraphic formal system with quantifier
Original language description
Both associative networks and RDF model (here we consider especially its graph version) belong to formal systems of knowledge representation based on concept-oriented paradigm. To treat properties of both of them as common properties of the systems is therefore natural. The article shows a possibility to use universal and existential quantified statements introduced prior to associative networks also within RDF graphic system and to define a RDF formal system with extended syntax and semantic that can use inference rules of associative networks. As an example solution, a logical puzzle is presented.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the International Multiconference on Computer Science and Information Technology
ISBN
978-1-4244-6432-6
ISSN
2157-5525
e-ISSN
—
Number of pages
931
Pages from-to
67-72
Publisher name
IEEE Computer Society
Place of publication
Mragowo, Poland
Event location
Wisla, Poland
Event date
Oct 18, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—