2005
DOI: 10.1007/11524564_2
|View full text |Cite
|
Sign up to set email alerts
|

Conceptual Graphs for Semantic Web Applications

Abstract: Abstract. In this paper, we aim at showing the advantages of Conceptual Graph formalism for the Semantic Web through several real-world applications in the framework of Corporate Semantic Webs. We describe the RDF(S)-dedicated semantic search engine, CORESE, based on a correspondence between RDF(S) and Conceptual Graphs, and we illustrate the interest of Conceptual Graphs through the analysis of several real-world applications based on CORESE.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 17 publications
(12 citation statements)
references
References 32 publications
0
12
0
Order By: Relevance
“…In real life applications the ontologies and their relationships can typically be represented as standardized ontology graphs [4], [7], [13], [19]. An ontology graph O = (V r , E r ) is an undirected graph, where (1) V r is a node set, where each node v r ∈ V r is a label referring to an entity; and (2) E r is a set of edges among the labels, where each edge e r ∈ E r represents a semantic relation (e.g., "refer to", "is a", "specialization" [19]) between two nodes.…”
Section: A Graphs Queries and Ontology Graphsmentioning
confidence: 99%
See 4 more Smart Citations
“…In real life applications the ontologies and their relationships can typically be represented as standardized ontology graphs [4], [7], [13], [19]. An ontology graph O = (V r , E r ) is an undirected graph, where (1) V r is a node set, where each node v r ∈ V r is a label referring to an entity; and (2) E r is a set of edges among the labels, where each edge e r ∈ E r represents a semantic relation (e.g., "refer to", "is a", "specialization" [19]) between two nodes.…”
Section: A Graphs Queries and Ontology Graphsmentioning
confidence: 99%
“…In practice, the ontology graphs and sim () can be obtained from e.g., semantic Web applications [13], Web mining [20], or domain experts [4]. While proposing more sophisticated models for ontologies and similarity functions are beyond the scope of this paper, we focus on technique that applies to a class of similarity functions sim ().…”
Section: A Graphs Queries and Ontology Graphsmentioning
confidence: 99%
See 3 more Smart Citations