-
Mouhamadou Ba,
Sébastien Ferré,
and Mireille Ducassé.
Safe Suggestions Based on Type Convertibility to Guide Workflow Composition.
In F. Esposito,
O. Pivert,
M.-S. Hacid,
Z.W. Ras,
and S. Ferilli, editors,
Int. Symp. Foundations of Intelligent Systems (ISMIS),
LNCS 9384,
2015.
Springer.
Abstract:
This paper proposes an interactive approach that guides users in the step-by-step composition of services by providing safe suggestions based on type convertibility. % Users specify the points of the workflow (called the focus) they want to complete, and our approach suggests services and connections whose data types are compatible with the focus. % We prove the safeness (every step produces a well-formed workflow) and the completeness (every well-formed workflow can be built) of our approach. |
@inproceedings{ba2015ISMIS,
author = {Mouhamadou Ba and S{\'{e}}bastien Ferr{\'{e}} and Mireille Ducass{\'{e}}},
title = {Safe Suggestions Based on Type Convertibility to Guide Workflow Composition},
booktitle = {Int. Symp. Foundations of Intelligent Systems (ISMIS)},
publisher = {Springer},
series = {LNCS 9384},
editor = {F. Esposito and O. Pivert and M.-S. Hacid and Z.W. Ras and S. Ferilli},
year = {2015},
abstract = { This paper proposes an interactive approach that guides users in the step-by-step composition of services by providing safe suggestions based on type convertibility. % Users specify the points of the workflow (called the focus) they want to complete, and our approach suggests services and connections whose data types are compatible with the focus. % We prove the safeness (every step produces a well-formed workflow) and the completeness (every well-formed workflow can be built) of our approach. }
}
-
Sébastien Ferré.
A Proposal for Extending Formal Concept Analysis to Knowledge Graphs.
In J. Baixeries,
C. Sacarea,
and M. Ojeda-Aciego, editors,
Int. Conf. Formal Concept Analysis (ICFCA),
LNCS 9113,
pages 271-286,
2015.
Springer.
Keyword(s): formal concept analysis,
knowledge graph,
Semantic Web,
graph pattern,
relation,
projection.
Abstract:
Knowledge graphs offer a versatile knowledge representation, and have been studied under different forms, such as conceptual graphs or Datalog databases. With the rise of the Semantic Web, more and more data are available as knowledge graphs. FCA has been successful for analyzing, mining, learning, and exploring tabular data, and our aim is to help transpose those results to graph-based data. Previous FCA approaches have already addressed relational data, hence graphs, but with various limits. We propose G-FCA as an extension of FCA where the formal context is a knowledge graph based on n-ary relationships. The main contributions is the introduction of ``n-ary concepts'', i.e. concepts whose extents are n-ary relations of objects. Their intents, ``projected graph patterns'', mix relationships of different arities, objects, and variables. In this paper, we lay first theoretical results, in particular the existence of a concept lattice for each concept arity, and the role of relational projections to connect those different lattices. |
@inproceedings{Fer2015icfca,
author = {S{\'{e}}bastien Ferr{\'{e}}},
title = {A Proposal for Extending Formal Concept Analysis to Knowledge Graphs},
booktitle = {Int. Conf. Formal Concept Analysis ({ICFCA})},
pages = {271--286},
year = {2015},
editor = {J. Baixeries and C. Sacarea and M. Ojeda{-}Aciego},
series = {LNCS 9113},
publisher = {Springer},
keywords = {formal concept analysis, knowledge graph, Semantic Web, graph pattern, relation, projection},
abstract = { Knowledge graphs offer a versatile knowledge representation, and have been studied under different forms, such as conceptual graphs or Datalog databases. With the rise of the Semantic Web, more and more data are available as knowledge graphs. FCA has been successful for analyzing, mining, learning, and exploring tabular data, and our aim is to help transpose those results to graph-based data. Previous FCA approaches have already addressed relational data, hence graphs, but with various limits. We propose G-FCA as an extension of FCA where the formal context is a knowledge graph based on n-ary relationships. The main contributions is the introduction of ``n-ary concepts'', i.e. concepts whose extents are n-ary relations of objects. Their intents, ``projected graph patterns'', mix relationships of different arities, objects, and variables. In this paper, we lay first theoretical results, in particular the existence of a concept lattice for each concept arity, and the role of relational projections to connect those different lattices. }
}
-
Sébastien Ferré.
Conception interactive d'ontologies par élimination de mondes possibles.
In Ingénierie des connaissances (IC),
2015.
AFIA.
[WWW]
Keyword(s): Semantic Web,
ontology,
OWL,
design,
syntax/semantic gap,
interaction.
Abstract:
La conception d'ontologies constitue souvent un frein à l'adoption des techniques de l'ingénierie des connaissances et du Web sémantique. Une raison est bien sûr l'emploi de formalismes et des concepts logiques qui y sont associés. Une autre raison qui nous semble plus profonde est le fossé entre syntaxe et sémantique, c'est-à-dire entre la forme de surface de l'ontologie (axiomes) et ce qu'elle rend nécessaire/possible/impossible (modèles). Ce fossé entraîne des divergences entre l'intention du concepteur et sa modélisation qui se manifestent par des inférences inattendues, voire des incohérences. Nous proposons une nouvelle approche de conception d'ontologies fondée sur l'exploration et l'élimination interactive de ``mondes possibles'' (modèles). Elle réduit le fossé syntaxe/sémantique en interdisant par construction la production d'incohérence, et en montrant en permanence au concepteur ce qui peut être inféré ou non. Un prototype, PEW (Possible World Explorer), permet d'expérimenter cette approche et de la comparer à d'autres éditeurs d'ontologies. |
@inproceedings{Fer2015ic,
title={Conception interactive d'ontologies par {\'e}limination de mondes possibles},
author={Ferr{\'e}, S{\'e}bastien},
booktitle={Ing\'enierie des connaissances ({IC})},
year={2015},
url={https://hal.inria.fr/hal-01165493},
organization={AFIA},
keywords={Semantic Web, ontology, OWL, design, syntax/semantic gap, interaction},
abstract={ La conception d'ontologies constitue souvent un frein à l'adoption des techniques de l'ingénierie des connaissances et du Web sémantique. Une raison est bien sûr l'emploi de formalismes et des concepts logiques qui y sont associés. Une autre raison qui nous semble plus profonde est le fossé entre syntaxe et sémantique, c'est-à-dire entre la forme de surface de l'ontologie (axiomes) et ce qu'elle rend nécessaire/possible/impossible (modèles). Ce fossé entraîne des divergences entre l'intention du concepteur et sa modélisation qui se manifestent par des inférences inattendues, voire des incohérences. Nous proposons une nouvelle approche de conception d'ontologies fondée sur l'exploration et l'élimination interactive de ``mondes possibles'' (modèles). Elle réduit le fossé syntaxe/sémantique en interdisant par construction la production d'incohérence, et en montrant en permanence au concepteur ce qui peut être inféré ou non. Un prototype, PEW (Possible World Explorer), permet d'expérimenter cette approche et de la comparer à d'autres éditeurs d'ontologies. }
}