A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Translations between RDF(S) and Conceptual Graphs
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
Though similarities between the Semantic Web language RDF(S) and languages of the Conceptual Graphs family have often been pointed out, the differences between these formalisms have been a source of difficulties ...
while trying to translate objets of a language into the other. ...
More specifically, we will focus on transformations between Conceptual Graphs (CGs) [10, 4] and the RDF(S) language [8] , the standard for Semantic Web annotations. ...
doi:10.1007/978-3-642-14197-3_7
fatcat:wivkizdfrjgg7e4ckni2imt2ey
A Conceptual Graph and RDF(S) Approach for Representing and Querying Document Content
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
This article describes a first synthesis of a Conceptual Graph and RDF(S) approach for representing and querying document contents. ...
The motivation of this paper is to give a first synthesis of the translation process from the pivot language to RDF(S) and CG, to underline the main problems encountered during this translation. ...
Translation Process: Pivot Language-RDF(S)-CG In this section, we detail the process of translating ontologies and annotations from pivot language to RDF(S) and conceptual graphs. ...
doi:10.1007/3-540-36131-6_13
fatcat:hgi4zha3cnggpczhnsson3tcbi
Cognitive agents and machine learning by example: Representation with conceptual graphs
2018
Computational intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It has been shown that MRL and RDF can be translated to CG, and as such it is plausible that even without a graph being the representation, a spatialtemporal sequence could Markovianly describe another ...
In addition to creating nodes, an action can also be the decision to create edges between concepts and relations, and thus creating a connected conceptual graph. [ Figure 4 about here.] ...
doi:10.1111/coin.12167
fatcat:fdi3fqgxivfsbgyusdtlmghu5q
Extending RDF(S) with Contextual and Definitional Knowledge
2001
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This extension is based on the similarities between the RDF and CG models: a context is just the translation of a conceptual graph. ...
Section 3 is dedicated to the comparison of RDF(S) and the Conceptual Graphs model. ...
dblp:conf/ijcai/DelteilF01
fatcat:vacujpcicbbejgd5ylpdhtsbwa
Hera-S
2006
Proceedings of the 6th international conference on Web engineering - ICWE '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Hera-S allows designers the plain use of the Semantic Web languages RDFS and OWL for designing the domain model and the context data model, thus enabling re-use of existing data models and opening up the ...
RDF instance data to queries and updates via the Sesame RDFframework. ...
The simplest and most straightforward case is an offline translation of the data to RDF and simply storing that RDF in a Sesame repository. ...
doi:10.1145/1145581.1145646
dblp:conf/icwe/SluijsHBC06
fatcat:sntnp2ti5jay3nwslppxvcopjy
Efficiently Querying RDF(S) Ontologies with Answer Set Programming
2008
Journal of Logic and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Results reported in the paper show that our proposed framework is promising for the improvement of both scalability and expressiveness of available RDF(S) storage and query systems. ...
This work is a first step toward this setting: it first shows that RDF(S) ontologies can be expressed, without loss of semantics, into Answer Set Programming (ASP). ...
In order to encode in ASP the problem of deciding RDFS entailment between two graphs G 1 and G 2 , we adopt two translations T 1 and T 2 , and an ASP EX program D, which simulates RDFS entailment rules ...
doi:10.1093/logcom/exn043
fatcat:mfx34qrpebf27kgyfhqy3cufoy
OWL-S for Describing Artifacts
2006
European Workshop on Multi-Agent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we investigate how to represent the artifact features by means of OWL-S, provide an example, and discuss some preliminary results in terms of advantages and limitations of this approach. ...
In order to enable agents to autonomously discover the available services, select the proper artifact(s), and use the services they need, it is necessary to describe the services offered by artifacts in ...
Artifact Representation The mapping between the artifact features and OWL-S could be represented through an RDF Graph as depicted in Figure 2 . ...
dblp:conf/eumas/RubinoMD06
fatcat:nybmxp577fgmdnvgz6kddxnfwa
Searching and Establishment of S-P-O Relationships for Linked RDF Graphs : An Adaptive Approach
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For analyzing inter relationship between two RDF Graphs, RDF- Schema (RDFS) should also be taken care of. ...
In the present paper, an adaptive combination rule based framework has been proposed for establishment of S P O relationship and RDF Graph searching is reported. ...
between RDF graphs within the scope of S 1 and S 2 . ...
arXiv:1311.7200v1
fatcat:hyclk6d2mjfrfmbpe3e4ca73vu
RDF(S) INTEROPERABILITY RESULTS FOR SEMANTIC WEB TECHNOLOGIES
2009
International journal of software engineering and knowledge engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Interoperability among difierent development tools is not a straightforward task since ontology editors rely on specific internal knowledge models which are translated into common formats such as RDF(S ...
This paper addresses the urgent need for interoperability by providing an exhaustive set of benchmark suites for evaluating RDF(S) import, export and interoperability. ...
Thanks to all the people that have participated in the RDF(S) Interoperability Benchmarking: Olivier Corby, Jesús Prieto-González. York Sure, Moritz Weiten, and Markus Zondler. ...
doi:10.1142/s0218194009004556
fatcat:t5am6y5krvfundhkfpjymmfgme
The Semantic Web: the roles of XML and RDF
2000
IEEE Internet Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Generally defined as shared formal conceptualizations of particular domains, ontologies provide a common understanding of topics that can be communicated between people and application systems. ...
crucial role in enabling Web-based knowledge processing, sharing, and reuse between applications. ...
RDF graph. ...
doi:10.1109/4236.877487
fatcat:3f6njwfgsrb3xktjmqxa3g6n34
A Datatype Extension for Simple Conceptual Graphs and Conceptual Graphs Rules
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. ...
Though the model-theoretic semantics of these datatypes is inspired by the work done for RDF/RDFS, keeping sound and complete projection-based algorithms for deduction has led to strong syntactic restrictions ...
With simple conceptual graphs, there is no distinction between full and partial semantics (since there is no string). Every graph is satisfiable, and the only valid graph is the empty graph. ...
doi:10.1007/978-3-540-73681-3_7
fatcat:rlwuhl4mevbdfdyotwlmqgjiqa
The CG Formalism as an Ontolingua for Web-Oriented Representation Languages
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Though there may be many knowledge representation formalisms suited for that task, we advocate the use of the conceptual graph formalism. ...
It is expected that many one-to-one mappings between pairs of document representation formalisms will eventually arise. ...
Tim Berners-Lee compared RDF and conceptual graphs and concluded that Conceptual Graphs are easily integrated with the Semantic Web [2] . ...
doi:10.1007/3-540-45483-7_16
fatcat:4yvhnqt2inev5hdli3xbln3i6q
Converting Alzheimer s disease map into a heavyweight ontology: a formal network to integrate data
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Alzheimer s disease (AD) pathophysiology is still imperfectly understood and current paradigms have not led to curative outcome. ...
AlzPathway is a disease map that gives a detailed and broad account of AD pathophysiology. However, AlzPathway lacks formalism, which can lead to ambiguity and misinterpretation. ...
The research leading to these results has received funding from the program "Investissements d'avenir" ANR-10-IAIHU-06 (Agence Nationale de la Recherche-10-IA Institut Hospitalo-Universitaire-6) and from ...
arXiv:1807.10509v1
fatcat:ow45axqhbbgyxb6utebzdo7pqm
Sparql query processing in relational databases
2018
International Journal of Engineering & Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Both the relationships in ER model and predicates in RDF model describe the relations between things.Since RDB and RDF share the similar modeling approach at the schema level, it is reasonable that mapping ...
The paper also presents SPARQL query processing in RDB.Findings: There are distinct differences between instance level mapping and conceptual level mapping for RDB2RDF. ...
Similarity of ER and RDF models: there are similarity between ER model and RDF mode from conceptual model perspective. ...
doi:10.14419/ijet.v7i2.33.13860
fatcat:xoolr2gxdjfhvpka4wjrbzerj4
A Conceptual Graph Model for W3C Resource Description Framework
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Our approach is to exploit a standard language (RDF, recommended by W3C) for expressing such metadata and to interpret these metadata in conceptual graphs (CG) in order to exploit querying and inferencing ...
The paper presents our mapping of RDF into CG and its interest in the context of the semantic Web. ...
Acknowledgement We thank Ahmed Amerkad who implemented the CG to RDF translator, Peter Eklund, Philippe Martin and Denis Kuntz for proofreading the paper, the remaining errors being ours. ...
doi:10.1007/10722280_32
fatcat:s74jx7xynbgb5c4rjuuidnnk7q
« Previous
Showing results 1 — 15 out of 4,778 results