Sciweavers

Share
6 search results - page 1 / 2
» Ontology-revision operators based on reinterpretation
Sort
View
IGPL
2010
158views more  IGPL 2010»
9 years 5 months ago
Ontology-revision operators based on reinterpretation
Communication between natural or artificial agents relies on the use of a common vocabulary. Since sharing terms does not necessarily imply that the terms have exactly the same m...
Carola Eschenbach, Özgür L. Öz&cced...
AAAI
2015
4 years 3 months ago
Approximating Model-Based ABox Revision in DL-Lite: Theory and Practice
Model-based approaches provide a semantically well justified way to revise ontologies. However, in general, model-based revision operators are limited due to lack of efficient a...
Guilin Qi, Zhe Wang, Kewen Wang, Xuefeng Fu, Zhiqi...
ISMIS
2003
Springer
10 years 5 days ago
Granular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two...
Y. Y. Yao, Churn-Jung Liau, Ning Zhong
COMPSAC
2009
IEEE
9 years 11 months ago
Towards a Theory for Testing Non-terminating Programs
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
Arnaud Gotlieb, Matthieu Petit
AIEDAM
2000
134views more  AIEDAM 2000»
9 years 6 months ago
Adaptive enlargement of state spaces in evolutionary designing
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
John S. Gero, Vladimir A. Kazakov
books