For first-order probabilistic knowledge representation, grounding is an important means to define a semantics for knowledge bases which extends the propositional semantics. However, naive approaches to grounding may give rise to conflicts and inconsistencies, in particular, if the formalism involves point probabilities, in contrast to using approximative or interval-based probabilities. In this...

In recent years the term knowledge management has been used to describe the efforts of organisations to capture, store, and deploy knowledge. Most current knowledge management activities rely on database and web technology; currently, few organisations have a systematic process for capturing knowledge, as distinct from data. The paper presents a case study in which knowledge engineering practic...

regarding the large number of developed particle swarm optimization (pso) algorithms and the various applications for which pso has been used, selecting the most suitable variant of pso for solving a particular optimization problem is a challenge for most researchers. in this paper, using a comprehensive survey and taxonomy on different types of pso, an expert system (es) is designed to identif...

How should what one knows about an individual a ect default conclusions about that individual This paper contrasts two views of knowledge in default reasoning systems The rst is the traditional view that one knows the logical consequences of one s knowledge base It is shown how under this interpretation having to know an excep tion is too strong for default reasoning It is argued that we need t...

This article presents the transformation of the noun-related part of WordNet into a genuine “lexical ontology” to support knowledge representation, sharing and retrieval within a knowledge base or on the Web, i.e. to support “knowledge creation and communication”. The corrections and extensions are documented at http://www.webkb.org/doc/wn/ and the ontology is downloadable in various formats. W...

It is known that prominent fragments of propositional logic are not closed under standard belief change operators. That is, applying such operators to knowledge bases in a fragment may produce results that have no equivalent in the same language. However, the potential range of such a deviation has not been investigated yet. In this paper, we give a systematic study of this problem by consideri...

In a unified knowledge representation data, information and knowledge are all represented in a single formalism as “items”. Objects are item building operators. Items and objects contain two types of acceptability measures that measure the invalidity of item instances. A quantitative calculus estimates the extent to which knowledge base integrity may be expected to degrade as time passes. This ...