Titlebook: Conceptual Structures for Knowledge Creation and Communication; 11th International C Bernhard Ganter,Aldo Moor,Wilfried Lex Conference proc

interior

廣口瓶

Computing the Least Common Subsumer in the Description Logic , w.r.t. Terminological Cycles with Desumer, they can also be used to approximate the lcs even if it does not exist. In addition, we give a sufficient condition for the lcs to exist, and show that, under this condition, it can be computed in polynomial time.

SPALL

極為憤怒

Hypotheses and Version Spacesscussed. We give an algorithm how to generate a version space for which the classifiers are closed under conjunction..As an application we discuss an example from predicitive toxicology. The classifiers here are chemical compounds and their substructures. The example also indicates how the methodology can be applied to Conceptual Graphs.

negligence

救護(hù)車

確定方向

Mohammad Taufique,Vajahat Khursheeds coded in the power context family. The main result of this paper is that the conceptual contents can be derived as extents of the so-called . of the corresponding power context family. In short, the conceptual contents of judgments are formally derivable as concept extents.

Eviction

Victor Squires,Zhang Degang,Hua Liminalence relation is introduced. The purpose of this relation is to enable formalization of intensional equivalence of concepts. The intensional semantics is defined by a novel algebraic semantics which basically is an algebraic generalization of the well-known extensional semantics.

TAG

Charlotte Bellmann,Olav Clemensevelopped for Constraint Satisfaction Problems. In order to benefit from the optimization work done in this community, we have chosen to present an alternate version of SGs, differences being the definition of these graphs as hypergraphs and the use of conjunctive types.

SOB