Buscar
Mostrando ítems 11-20 de 30
Artículo
Foundational Challenges in Automated Data and Ontology Cleaning in the Semantic Web
(IEEE Computer Society, 2006)
The application of automated reasoning systems to data cleaning in the Semantic Web raises many challenges on the foundational basis of cleaning agent design. The authors discuss some of them. They finally argue that ...
Ponencia
Towards a tool for ontology engineering
(IEEE Computer Society, 2004)
A tool based on a spatial representation of provisional ontologies is designed. The tool allows the cleming of Knowledge Bases, aa well to induce new concepts in early steps of the building of an ontology.
Ponencia
Generalizing Programs via Subsumption
(Springer, 2003)
In this paper we present a class of operators for Machine Learning based on Logic Programming which represents a characterization of the subsumption relation in the following sense: The clause C 1 subsumes the clause C 2 ...
Artículo
Verification of the Formal Concept Analysis
(Real Academia de Ciencias, 2004)
This paper is concerned with a formal verification of the Formal Concept Analysis framework. We use the PVS system to represent and formally verify some algorithms of this theory. We also develop a method to transform ...
Ponencia
Visual Ontology Cleaning: Cognitive Principles and Applicability
(Springer, 2006)
In this paper we connect two research areas, the Qualitative Spatial Reasoning and visual reasoning on ontologies. We discuss the logical limitations of the mereotopological approach to the visual ontology cleaning, ...
Ponencia
Proximidad entre cláusulas en programación lógica inductiva
(Universidad de Sevilla - Fundación El Monte, 2001)
Ponencia
A Topological Study of the Upward Refinement Operators on ILP
(CEUR-WS, 2000)
Ponencia
A Formal Foundation for Knowledge Integration of Defficent Information in the Semantic Web
(Springer, 2007)
Maintenance of logical robustness in Information Integration represents a major challenge in the envisioned Semantic Web. In this framework, it is previsible unprecise information (with respect to an ontology) is retrieved ...
Ponencia
A Quasi-Metric for Machine Learning
(Springer, 2002)
The subsumption relation is crucial in the Machine Learning systems based on a clausal representation. In this paper we present a class of operators for Machine Learning based on clauses which is a characterization of the ...
Ponencia
Ontology Cleaning by Mereotopological Reasoning
(IEEE Computer Society, 2004)
A mereotopological semantics to manage ontologies is presented. The aim is to provide a formal basis for ontology cleaning. It allows us to arrange, in a consistent manner, the concepts in early steps of the building ...