Reasoning in RDF graphic formal system with quantifiers

Lukasová, Alena; Vajgl, Marek; Žáček, Martin

doi:10.1109/imcsit.2010.5679944

Cited by 9 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a bit more general point of view, the RDF graphics [8], as well as semantic network of a concept represented by graph, give a possibility to see a concept together with an explanation of their semantics. The concept shown along with accompanying information about its context of a modeling world has been defined in this way by its "intentionally defined" semantics.…”

Section: A Common Base-the Concept-relationship Paradigm Of Seeing a mentioning

confidence: 99%

“…Taking the world of discourse under the general concept-relations paradigm led the formal representation towards a crucial simplified form of elementary statement about the world. Thus, the language naturally followed the RDF(S) [8] model. For example, at a simple sentence "Each man that has been married to a wife is her husband."…”

Section: Rdf Model As a Main Principle Of A Semantic Web Languagementioning

confidence: 99%

See 1 more Smart Citation

Semantic Web Languages: Expressivity of SWL

Žáček

Lukasová

Vajgl

et al. 2019

Intelligent Information and Database Systems: Recent Developments

View full text Add to dashboard Cite

The paper tries to discuss from a slightly higher level a focus oriented towards general properties that a Semantic Web Language (SWL) must have. We state as a ground the following two points of view: to compare (1) Expressivity of the SWL, and (2) a possibility to infer new knowledge from an SWL knowledge base with corresponding properties of the classical First Order Logics (FOPL) as a measure of their basic quality (now prepared). From expressivity, the language for the semantic web must be a common communication tool for computers as well as for people fulfilling an easy-to-use condition by means of adding more semantics directly into the language's syntax. After a discussion of properties and critical recommendations two languages, OWL DL1 and RDF CFL have been proposed here to become the SWL both having the expressivity comparable with the FOPL.

show abstract

Section: A Common Base-the Concept-relationship Paradigm Of Seeing a mentioning

confidence: 99%

Section: Rdf Model As a Main Principle Of A Semantic Web Languagementioning

confidence: 99%

Semantic Web Languages: Expressivity of SWL

Žáček

Lukasová

Vajgl

et al. 2019

Intelligent Information and Database Systems: Recent Developments

View full text Add to dashboard Cite

show abstract

“…Graf RDFCFL version given here as conveyed by GRDF [5] belongs, like special associative networks to formal means of knowledge representation based on concept-oriented paradigm. It is therefore natural to use here their common properties and transfer into RDF networks what already has been proven in the GCFL associative networks.…”

Section: Graph Version Gcfl and Its Modification Rdfcflmentioning

confidence: 99%

Knowledge bases built on web languages from the point of view of predicate logics

Vajgl

Lukasová

Žáček

2017

AIP Conference Proceedings

View full text Add to dashboard Cite

Abstract. The article undergoes evaluation of formal systems created on the base of web (ontology/concept) languages by simplifying the usual approach of knowledge representation within the FOPL, but sharing its expressiveness, semantic correct-ness, completeness and decidability. Evaluation of two of them -that one based on description logic and that one built on RDF model principles -identifies some of the lacks of those formal systems and presents, if possible, corrections of them. Possibilities to build an inference system capable to obtain new further knowledge over given knowledge bases including those describing domains by giant linked domain databases has been taken into account. Moreover, the directions towards simplifying FOPL language discussed here has been evaluated from the point of view of a possibility to become a web language for fulfilling an idea of semantic web.

show abstract

“…Together both rules form the resolution rule as well as in the CFL. In the frame of associative networks [2,3] the resolution rule has been slightly modified and it is known as the transfer rule.…”

Section: Resolution Reasoning On Gcfl Knowledge Basementioning

confidence: 99%

Modeling knowledge base and derivation without predefined structure by Graph-based Clausal Form Logic

Žáek¹,

Lukasová²,

Miarka³

2013

Proceedings of the 2013 International Conference on Advanced ICT

View full text Add to dashboard Cite

This paper follows the work of T. Richards specialization Clausal Form Logic formal system of the first order logic. The paper presents also the way of using graph-based clausal form statements in the frame of semantic (associative) 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 graphbased formal system. The new formal system Graph-based Clausal Form Logic has its own graph-based language with the expressivity similar to that one of CFL. As an example solution, a logical puzzle is presented.

show abstract

Reasoning in RDF graphic formal system with quantifiers

Cited by 9 publications

References 0 publications

Semantic Web Languages: Expressivity of SWL

Semantic Web Languages: Expressivity of SWL

Knowledge bases built on web languages from the point of view of predicate logics

Modeling knowledge base and derivation without predefined structure by Graph-based Clausal Form Logic

Contact Info

Product

Resources

About