Polarized conceptual graphs (PGs) are simple conceptual graphs added with a restricted form of negation, namely negation on relations. Classical deduction with PGs (in short PG-Deduction) is highly intractable; it is indeed Π P complete. In [LM06] a brute-force algorithm for solving PG-Deduction was outlined. In the present paper, we extend previous work with two kinds of results. First, we exh...

Knowledge management applications need to determine whether two or more knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the same content but differ substantially in form. Previous approaches to this problem have used either syntactic measure or semantic knowledge to determine the distance between two representations. ...

For succesful information systems development, conceptual data modelling is essential. Nowadays many techniques for conceptual data modelling exist, examples are NIAM, FORM, PSM, many (E)ER variants, IFO, and FDM. In-depth comparisons of concepts of these techniques is very diicult as the mathematical formalisations of these techniques, if existing at all, are very diierent. As such there is a ...

Fuzzy set theory has been extensively applied to extend various database models and resulted in numerous contributions, mainly with respect to the popular relational model or to some related form of it. To satisfy the need of modeling complex objects with imprecision and uncertainty, recently many researches have been concentrated on fuzzy semantic (conceptual) data models. This paper reviews f...

We explore many ways of using conceptual distance measures in Word Sense Disambiguation, starting with the Agirre-Rigau conceptual density measure. We use a generalized form of this measure, introducing many (parameterized) refinements and performing an exhaustive evaluation of all meaningful combinations. We finally obtain a 42% improvement over the original algorithm, and show that measures o...

Conceptual graphs are applied to a problem in database inference known as secondpath analysis. A sensitive target is proposed, namely to keep secret that a certain company is working on a certain project. Typically available non-sensitive information is introduced in the form of relational database schemata. These schemata are then expressed as conceptual graphs, followed by a series of joins w...

This paper compares and contrasts the way knowledge is captured and manipulated between COPE and conceptual graphs. COPE, an acronym for Cognitive Policy Evaluation, is existing computer software whereas a conceptual graphs processor is a potential such candidate. COPE depicts the cognitive maps of Eden (1991), whose work stems from that of Kelly (1955). Conceptual graphs are another form of co...

A parallel of elementary concepts but non-mathematically obtainable contrasts is described as entailed to all aspects of nature ubiquitously if conceptual pluralisms/dualisms are logically reduced to monisms. In order for active perceptual/conceptual science pursuit to exist with a valid and coherent meaning, conceptually organizable, but non-parametric sameness/equality of some sort must be at...

Recent efforts in the Conceptual Modelling community have been devoted to properly capturing time-varying information. Various temporally enhanced Entity-Relationship (ER) models have been proposed that are intended to model the temporal aspects of database conceptual schemas. This work gives a logical formalisation of the various properties that characterise and extend different temporal ER mo...

Conceptual models and their visualizations play an important role in the in the Information Systems (IS) field. Their track record, however, is mixed. While their benefits are clearly perceived, practitioners also struggle with their use. This paper picks up on a potential factor that limits the effectiveness of conceptual models, namely the poor design rationale behind their visual appearance....