Sciweavers

1391 search results - page 252 / 279
» Completeness of Neighbourhood Logic
Sort
View
IJSI
2010
84views more  IJSI 2010»
13 years 8 months ago
Computational Complexity and Anytime Algorithm for Inconsistency Measurement
Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods hav...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...
LOGCOM
2010
143views more  LOGCOM 2010»
13 years 8 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
MST
2010
140views more  MST 2010»
13 years 8 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
PPDP
2010
Springer
13 years 8 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
DLOG
2010
13 years 8 months ago
Towards Soundness Preserving Approximation for ABox Reasoning of OWL2
ABox Reasoning in large scale description logic (DL) knowledge bases, e.g. ontologies, is important for the success of many semantic-enriched systems. Performance of existing appro...
Yuan Ren, Jeff Z. Pan, Yuting Zhao