Sciweavers

63 search results - page 10 / 13
» The Bounded Axiom A Forcing Axiom
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Semi-Distributed Axiomatic Game Theoretical Mechanism for Replicating Data Objects in Large Distributed Computing Systems
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
Samee Ullah Khan, Ishfaq Ahmad
KI
2007
Springer
14 years 2 months ago
Pinpointing in the Description Logic EL+
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
Franz Baader, Rafael Peñaloza, Boontawee Su...
EKAW
2008
Springer
13 years 10 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
MLQ
2008
63views more  MLQ 2008»
13 years 8 months ago
The stationary set splitting game
The stationary set splitting game is a game of perfect information of length 1 between two players, unsplit and split, in which unsplit chooses stationarily many countable ordinal...
Paul B. Larson, Saharon Shelah
APAL
2010
141views more  APAL 2010»
13 years 8 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters