Fundamenta Informaticae - Volume 42, issue 2

Authors: Boldini, Pascal

Article Type: Research Article

Abstract: The article discusses formal aspects of the notion of context as needed in AI applications. We advocate the use of Martin-Löf's intuitionistic type theory to formalize and implement contexts. Through many examples belonging to the domains of computational semantics and knowledge based systems, we show that the built-in notion of context in intuitionistic type theory is a structure rich enough for representing most of the features that characterize contexts in an AI perspective. The fact that many recent theorem provers are built on the different theories of types suggests new perspectives in the development of AI applications.

Keywords: Artificial Intelligence, Contexts, Type Theory, Natural Language Processing, Knowledge Based Systems, Situations

DOI: 10.3233/FI-2000-42201

Citation: Fundamenta Informaticae, vol. 42, no. 2, pp. 105-127, 2000

Authors: Inkielman, Marcin

Article Type: Research Article

Abstract: The aim of this paper is to present a novel method of image segmentation based on multiresolution analysis. The main idea consists of the extraction of image parts which are coherent and are enclosed by a coherent region classified to another type. Segmentation is processed in two steps. The first, consists of pixel classification into predefined types and the second is detection of the hierarchical structure of an image. The method is presented here on examples being biomedical images but it may be also applied to analyze other types of images.

Keywords: Image Segmentation Description

DOI: 10.3233/FI-2000-42202

Citation: Fundamenta Informaticae, vol. 42, no. 2, pp. 129-148, 2000

Authors: Paz, Azaria | Geva, Robert Y. | Studený, Milan

Article Type: Research Article

Abstract: Irrelevance relations are sets of statements of the form: given that the ‘value’ of Z is known, the ‘values’ of Y can add no further information about the ‘values’ of X. Undirected Graphs (UGs), Directed Acyclic Graphs (DAGs) and Chain Graphs (CGs) were used and investigated as schemes for the purpose of representing irrelevance relations. It is known that, although all three schemes can approximate irrelevance, they are inadequate in the sense that there are relations which cannot be fully represented by anyone of them. In this paper annotated graphs are defined and suggested as a new model for graphical …representation. It is shown that this new model is a proper generalization of the former models: any irrelevance relation that can be represented by either one of the previous models can also be represented by an annotated graph, and there are relations that can be represented by an annotated graph but cannot be represented by either one of the former models. The question of whether this new model is powerful enough to represent all the irrelevance relations, as well as some other related questions, is still open. Show more

Keywords: irrelevance relation, graphoid, (regular) annotated graph, membership algorithm, annotation algorithm

DOI: 10.3233/FI-2000-42203

Citation: Fundamenta Informaticae, vol. 42, no. 2, pp. 149-199, 2000

Authors: Rabinovich, A.

Article Type: Research Article

Abstract: In [8, 11] the expressive completeness of the Propositional fragment of Duration Calculus relative to monadic first-order logic of order was established. In this paper we show that there is at least an exponential blow-up in every meaning preserving translation from monadic logic to PDC. Hence, there exists an exponential gap between the succinctness of monadic logic and that of duration calculus.

DOI: 10.3233/FI-2000-42204

Citation: Fundamenta Informaticae, vol. 42, no. 2, pp. 201-210, 2000