By Topic

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91

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
  • A new approach for the design of reinforcement schemes for learning automata: stochastic estimator learning algorithms

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

    A new approach to the design of S-model ergodic learning automata is introduced. The new scheme uses a stochastic estimator and is able to operate in nonstationary environments with high accuracy and high adaptation rate. The estimator is always recently updated and, consequently, is able to be adapted to environmental changes. The performance of the stochastic estimator learning automation (SELA)... 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.
  • Algorithmic support for intelligent fire-code checking

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

    Automatic intelligent fire-code checking is examined. A general approach is considered, wherein engineering code requirements are encoded in a knowledge-based expert system which evaluates a design for overall conformance. The system consists of a frame system, a rule system and a set of geometric algorithms. It identifies code violations and generates a report listing them. A number of the suppor... 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.
  • A neural network based expert system model

    Publication Year: 1991, Page(s):145 - 149
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    The architecture of an expert system model using artificial neural networks is proposed. The proposed model effectively supports the necessary components of an expert system such as user interface facility knowledge base, inference engine, and explanation system. The expert system model (ESM) consists of several orders of simple neural networks, each realizing a simple task. These simple neural ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 3-D structure modeling via constraint resolution

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

    A study is made of the design of a tool for developing structure modeling systems. A constraint logic programming scheme is the framework chosen for the system. In order to determine the structure of a set of objects by resolving geometric relations, the representation scheme, which is based on rigid transformations, is used to express geometric relations algebraically. Parameters not determined i... 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.
  • Refinement of the structure of knowledge base by learning

    Publication Year: 1991, Page(s):264 - 271
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    It is argued that some failure in the existing expert systems mainly results from the ill-organized knowledge bases. The authors propose an effective structure for a knowledge base called a solution-oriented structure, which is different from various existing knowledge base structures. Using several strategies of machine learning, an expert system tool called THOUGHT can reorganize the systematic ... 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.
  • Toward a general methodology for specifying expert systems

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

    A general methodology for specifying both the model and the process knowledge of an expert system at different abstraction levels is proposed. Specifications are acquired and organized around the general notion of a task. The model specification of a task describes a partial model of the application domain and a partial model of the problem solving states relevant to the task. The process specific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstraction of formal specifications from program code

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

    A description is presented of the development of the tool AUTOSPEC (automated specification), which abstracts formal specifications from program code. The abstraction process can incorporate domain-specific information supplied interactively by the user, as necessary. The abstraction algorithms and a discussion of the use of formal methods and object-oriented techniques for the development of AUTO... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metalevel and temporal reasoning in KNOWBEL: features and implementation

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

    General-purpose knowledge representation systems serve two important purposes. First, such a system allows a knowledge engineer to model a new domain without being hampered by some special-purpose mechanism and without having to invent new tools. Second, knowledge stored in a general-purpose system becomes a resource that can be utilized by many users and applications within an organization. Three... 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.
  • 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 logic theory of learning from experience

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

    A formal description is presented of the process learning from experience. First-order logic is used as a language to denote knowledge. The theory consists of a first-order logic in Gentzen style, two concepts of counterexample and refutation by facts, and a hypothesis calculus for modifying a theory to match the human's observation and experiments. A comparison with nonmonotonic logic is also mad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A maxima-tracking method for skeletonization from Euclidean distance function

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

    A skeletonization algorithm based on the Euclidean distance function using the sequential maxima-tracking method is described which, when applied to a connected image, generates a connected skeleton composed of simple digital arcs. With a slight modification, the algorithm can preserve the more important features in the skeletal branches which touch the object boundary at corners. Therefore its ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DT: a classification problem solver with tabular-knowledge acquisition

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

    An approach is described to integrating a classification problem solving function and an interactive knowledge acquisition function on a tabular knowledge representation. A tabular knowledge base presents concept functions in DNF (disjunctive normal form), which handles disjunctive concepts with multiple-value attributes. Because of the peculiar knowledge-base construction, which represents concep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to rule induction and pruning

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

    The authors regard the rule induction problem as a search in the lattice of possible rules. Two kinds of search directions (top=generalization and down=specialization) and therefore two different kinds of algorithms exist. They propose the algorithms RELAX and its heuristical modification H-RELAX, which both use generalization as the search direction and therefore can be used for rule induction an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical stereo matching using feature groupings

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

    A feature based stereo matching system is designed. A hierarchical grouping process that groups line segments into more complex structures that are easier to match is proposed. The hierarchy consists of lines, vertices, edges and surfaces. Matching starts at the highest level of the hierarchy (surfaces) and proceeds to the lowest (lines). Higher level features are easier to match, because they are... View full abstract»

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

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

    The author concentrates on B. Natarajan's (1991) framework for learning classes of total functions of discrete domains. A. Ehrenfeucht and D. Haussler (1989) have shown that a subclass of decision trees is learnable in the sense defined by L. Valiant (1984). The author generalizes their definitions to m-ary domains and shows that the learnability of restricted decision tree classifiers ca... 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.
  • GMAL: a tool for AI systems construction

    Publication Year: 1991, Page(s):530 - 531
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    The author presents an actor language, GMAL (Gosseyn machine actor language), a tool for knowledge representation based on a reflective representation of the actor model. This modelization provides interesting features such as modularity, flexibility, inherent parallelism, and easy integration of intelligent functions (introspection) 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.
  • Generalized scheduling development environment

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

    A generalized scheduling development environment allows a person who composes schedules to specify both an application and a methodology, in developing a scheduling program. The authors have designed such a system and have built a proof-of-concept prototype. The prototype has been tested on two fairly different application examples. It demonstrates the expressive capability of logic programming in... View full abstract»

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