By Topic

Tools for Artificial Intelligence, 1991. TAI '91., Third International Conference on

Date 10-13 Nov. 1991

Filter Results

Displaying Results 1 - 25 of 86
  • Third International Conference on Tools for Artificial Intelligence TAI '91 (Cat. No.91CH3054-4)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • Preventing infinite looping in Prolog

    Publication Year: 1991, Page(s):524 - 525
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    A method is proposed to modify Prolog compilers so that infinite looping can often be avoided in recursive Prolog programs. The study is carried out in the context of deductive databases. Termination of recursive query processing here is related to boundedness: uniform boundedness and extensional boundedness. Limitations of this method are briefly discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of the decision tree

    Publication Year: 1991, Page(s):522 - 523
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    An approach is presented to the optimization of decision trees. A decision tree is considered optimal if it correctly classifies the known data set and has the minimal number of nodes. It is shown that it is important to decide the right order of attributes to test, for this can reduce the number of checking nodes in a decision tree View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KBMS support for conceptual modeling in AI

    Publication Year: 1991, Page(s):378 - 385
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    A connection between a world model about typing concepts of programming languages and an application domain model is outlined in order to conveniently generate a conceptual knowledge-base management system (KBMS) scheme for AI applications. The world model is defined in terms of a knowledge representation language and shall be incorporated into an interoperability supporting KBMS object manager. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative development life cycle (IDLC): a management process for large scale intelligent system development

    Publication Year: 1991, Page(s):520 - 521
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The iterative development life cycle (IDLC) provides a management process for the successful development of large-scale intelligent system applications. The iterative process minimizes both risks and costs by combining both the well structured management techniques of the waterfall process and the early validation techniques of the evolutionary model. This process is more adaptable to the full ran... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge-based configuration of computer systems using hierarchical partial choice

    Publication Year: 1991, Page(s):368 - 375
    Cited by:  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    A novel inference scheme is introduced which is called hierarchical partial choice and which efficiently generates configurations from a knowledge base of structural descriptions of computer components. This approach combines the acquisition and maintenance advantages (over rule-based systems) of a declarative system with an inference scheme that efficiently generates solutions, often with little ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AI in multimedia (panel session)

    Publication Year: 1991, Page(s):3 - 12
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    In this panel session, the following topics are discussed: artificial intelligence in business; artificial intelligence in multimedia; neural networks as a tool for artificial intelligence: software engineering for knowledge-based systems: and artificial intelligence as a solution for software engineering View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic contour segmentation for object analysis

    Publication Year: 1991, Page(s):518 - 519
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB)

    The problem of distinguishing shapes from a compound contour, which is formed by overlapping more than one distinct object, is considered. The algorithm exploits the fact that planar shapes can be completely described by contour segments, and that they can be decomposed at their maximum concavity into simpler objects. To reduce spurious decomposition, the decomposed segments are merged hypotheses.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic algorithm programming environment: Splicer

    Publication Year: 1991, Page(s):138 - 144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    Genetic algorithms have been used to solve parameter optimization problems and for machine learning. Basic genetic algorithm concepts are introduced. The authors discuss genetic algorithm applications, and present results of a project to develop a software tool-a genetic algorithm programming environment-called Splicer View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient hypothetical reasoning system for predicate-logic knowledge-base

    Publication Year: 1991, Page(s):360 - 367
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    The methods of fast hypothetical reasoning systems developed for propositional logic cannot be applicable in a straightforward manner to the predicate-logic case. A fast hypothetical reasoning mechanism that is effective for predicate-logic knowledge (actually for function-free predicate Horn-clause knowledge) is presented. A reasoning method developed in the deductive database area is effectively... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward a theory approach to visual knowledge

    Publication Year: 1991, Page(s):532 - 533
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    A discussion is presented of visual knowledge related to computer graphics and pattern recognition. Based on the visual knowledge model, some main principles of visual knowledge, including the preliminary definition, the classification of visual knowledge, a set of operating rules, and a method of learning concepts, are proposed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An ATMS-based geometric constraint solver for 3D CAD

    Publication Year: 1991, Page(s):282 - 290
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The authors have developed a constraint-based method of describing features. Every feature is controlled by geometric constraints, which naturally specify the dimensioning information that reflects the designer's intent. An ATMS-based geometric reasoning system is proposed that efficiently evaluates the constraints in order to determine geometric attributes, and detects over-constrained situations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boundary detection based on neural networks model

    Publication Year: 1991, Page(s):254 - 257
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A new model of feedforward neural networks is proposed for solving the problem of robust boundary detection. Structurally, it is based on a circular mask which is characterized as a symmetrical neural network. By analyzing the weighted intermediate pattern, a dominant pattern is found to appear repeatedly for similar boundary orientation. Hence, a piecewise linearized edge could be detected by thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Historical Rete networks for debugging rule-based systems

    Publication Year: 1991, Page(s):450 - 457
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    To debug a forward-chaining rule-based program, certain, historical, information is needed. System builders should be able to request such information directly, instead of having to rerun the program one step at a time or search a trace of run details. As a first step in designing an explanation system for answering such questions, a proposal is discussed for storing a forward-chaining program run... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel path-consistency algorithms for constraint satisfaction

    Publication Year: 1991, Page(s):516 - 517
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    The authors previously proposed (1991) a O(n3) path-consistency algorithm which requires O(n2) space, whereas other known O(n3) time complexity algorithms need O (n3) space. They use this algorithm as the main framework for a parallel version View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning textural concepts through multilevel symbolic transformations

    Publication Year: 1991, Page(s):100 - 107
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The TEXTRAL system, used for determining structural visual properties of textures through symbolic transformations, is presented. The method consists of two phases: one that extracts information from raw textural images by applying convolutional operators and learns an initial set of rules; and a second that iteratively extracts symbolic information from the transformed representation of initial i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New crossover operators in genetic algorithms

    Publication Year: 1991, Page(s):150 - 153
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    Two new crossover operators in genetic algorithms for solving some combinatorial problems with ordering are presented. One is enhanced order crossover (EOX). The other, GREE, is a heuristic crossover for a class of combinatorial optimization problems, such as traveling salesman problems (TSPs). Genetic algorithms using GREE as unique crossover run very fast and get good solutions. Combining GREE w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanizing skeptical abduction and its applications to artificial intelligence

    Publication Year: 1991, Page(s):300 - 307
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Abduction is the process of generating the best explanation as to why a fact is observed given what is already known. A real problem in this area is the selective generation of hypotheses that have some reasonable prospect of being valid. The author proposes the notion of skeptical abduction as a model to face this problem. After providing a definition of abductive reasoning, skeptical abduction a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The correspondence between methods of artificial intelligence and the production and maintenance of evolutionary software

    Publication Year: 1991, Page(s):114 - 118
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    Exploration is made of how methods of truth maintenance may be applied in the engineering of integrated, dynamic systems. In the life of a large system, it is not possible to foresee every significant event which may affect the behavior of the system. Truth maintenance techniques may prove useful in the production and maintenance of these large systems. A discussion is presented of how it is the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing biological and physical systems as temporal event hierarchies

    Publication Year: 1991, Page(s):172 - 180
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    A method for representing texts describing biological systems is presented. The representation is that which an educated layman would build from reading a text describing a biological system. This representation is viewed as a bridge between the English description of a biological system and deeper representations of such a system. The representation is based on temporal relations which are used t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature-based design evaluation through constraint structure unification

    Publication Year: 1991, Page(s):119 - 124
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Constraint structures are presented as a new knowledge structure to encode both engineering part designs and constraints on those designs. Using a common representational form for both designs and constraints results in a number of practical advantages for a design evaluation system grounded on constraint structures. First, a graph unification algorithm generalized to operate on constraint structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stable learning algorithm for recurrent neural networks

    Publication Year: 1991, Page(s):186 - 191
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The authors used the Liapunov approach to derive a new set of sufficient conditions that explain the stability of feedforward networks. A simplification of these conditions results in a new recurrent backpropagation algorithm. This algorithm preserves the local updating characteristic of the original algorithm but is, at the same time, found to be quite effective even for problems which offered re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shape analysis using morphological processing and genetic algorithms

    Publication Year: 1991, Page(s):130 - 137
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A novel way of combining morphological processing and genetic algorithms (GAs) to generate high-performance shape discrimination operators is presented. GAs can evolve operators that discriminate among classes comprising different shapes. The operators are defined as variable structuring elements and can be sequenced as program forms. The population of such operators, evaluated according to an ind... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capability of feedforward neural networks with Ω-shaped activation functions

    Publication Year: 1991, Page(s):200 - 207
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The capability of the multilayer feedforward layered neural network with Ω-shaped activation functions is studied. The authors prove that a three layer neural network with any continuous Ω-shaped activation function can approximate any continuous function in the multidimensional real space. Further theoretical extensions to the generalized Ω-shaped function are also explored. One... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for creating and adapting reactive systems

    Publication Year: 1991, Page(s):220 - 227
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    A methodology is presented for building integrated planning-reacting systems. The work is based on a formal process-based approach to building the reactive component; this makes it possible to formalize the concept of a planner improving a reactor. The planner design emphasizes how the planner can use the reactor to focus its reasoning, as well as how the reactor is guided by the planner to improv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.