Sciweavers

302 search results - page 7 / 61
» A Comparison of Upper Ontologies
Sort
View
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 6 months ago
A New Upper Bound on the Average Error Exponent for Multiple-Access Channels
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to...
Ali Nazari, S. Sandeep Pradhan, Achilleas Anastaso...
INFORMATICALT
2010
118views more  INFORMATICALT 2010»
13 years 5 months ago
Facilitating Ontology Development with Continuous Evaluation
In this paper we propose facilitating ontology development by constant evaluation of steps in the process of ontology development. Existing methodologies for ontology development a...
Dejan Lavbic, Marjan Krisper
AI
2010
Springer
13 years 8 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
IANDC
2006
77views more  IANDC 2006»
13 years 8 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
CADE
2007
Springer
14 years 8 months ago
First Order Reasoning on a Large Ontology
We present results of our work on using first order theorem proving to reason over a large ontology (the Suggested Upper Merged Ontology ? SUMO), and methods for making SUMO suita...
Adam Pease, Geoff Sutcliffe