Name
Abstract | ||
|---|---|---|
This paper proposes a constraint programming based approach to handle ontologies consistency, and more precisely user-defined consistencies. In practice, ontologies consistency is not still well handled in the current software environments. This is due to the algorithmic and language limitations of the tools developed to handle the consistency constraints. The idea of this paper is to tackle this problem by exploiting constraint programming which is proved to he efficient and provides various techniques to handle many types of constraints on different domains. |
Year | Venue | Keywords |
|---|---|---|
2011 | INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY | Constraint programming, filtering, ontologies, consistency checking, ontology evolution |
Field | DocType | Volume |
Ontology (information science),Constraint satisfaction,Computer science,Inductive programming,Constraint programming,Constraint satisfaction problem,Theoretical computer science,Concurrent constraint logic programming,Reactive programming,Programming domain | Journal | 8 |
Issue | ISSN | Citations |
1 | 1683-3198 | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moussa Benaissa | 1 | 8 | 4.59 |
| Yahia Lebbah | 2 | 115 | 19.34 |