2012
DOI: 10.1007/978-3-642-33615-7_14
|View full text |Cite
|
Sign up to set email alerts
|

Operations over Lightweight Ontologies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…Finally, previous work by the authors (Casanova et al, 2011) introduced the notion of open fragment, captured by the projection operation, and (Casanova et al, 2012b) covered some of the operations discussed in this paper.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, previous work by the authors (Casanova et al, 2011) introduced the notion of open fragment, captured by the projection operation, and (Casanova et al, 2012b) covered some of the operations discussed in this paper.…”
Section: Related Workmentioning
confidence: 99%
“…The presentation of this position paper is necessarily informal to stress the major point: familiar ontology design problems can be properly addressed by treating ontologies as theories and by defining a set of operations on ontologies. The machinery to handle constraints developed in (Casanova et al, 2010;2012a;2012b) provides the theoretical foundations of the paper. Previous work by the authors (Casanova et al, 2011) introduced the notion of open fragment, which is captured by projection.…”
Section: Introductionmentioning
confidence: 99%
“…We argued elsewhere [12] that certain familiar ontology design problems are profitably addressed by treating ontologies as theories and by defining a set of operations that create new ontologies, including their constraints, out of other ontologies. The projection, union, and deprecation operations help define new ontologies by reusing fragments of known ontologies, the intersection operation constructs the constraints that hold in two ontologies, and the difference operation returns the constraints that hold in one ontology, but not in the other.…”
Section: Introductionmentioning
confidence: 99%
“…In order to address the problems outlined in Section 1.2, this work will consider ontologies as logical theories, composed of vocabularies and constraints, and will define algebraic operations (Projection, Union, Intersection and Difference) over one or two ontologies, as proposed in (Casanova et al, 2012), using the concept of Constraint Graphs in order to enable the integration and interoperability of the data sources that follow the Linked Data principles. These algebraic operations permit defining new ontologies out of existing ones and take into account the semantics of the involved ontologies.…”
Section: Goal and Contributionsmentioning
confidence: 99%
“…We say that the complement of a basic concept description b is ¬b, and vice-versa. If e is a basic concept description, or the negation of a basic concept description, then e denotes the complement of e (Casanova et al, 2012).…”
Section: Constraint Graph Representationmentioning
confidence: 99%