5 search results - page 1 / 1 » Ontology-revision operators based on reinterpretation |
IGPL
2010
14 years 8 months ago
2010
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...
ISMIS
2003
Springer
15 years 3 months ago
2003
Springer
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...
SYNTHESE
2011
14 years 5 months ago
2011
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others1 , our an...
66
Voted
COMPSAC
2009
IEEE
15 years 2 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
AIEDAM
2000
14 years 10 months ago
2000
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...