Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

[Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence

23-25 Oct. 1989

Filter Results

Displaying Results 1 - 25 of 92
  • IEEE International Workshop on Tools for Artificial Intelligence. Architectures, Languages and Algorithms

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • Macro transform approach to solve indecomposable problems

    Publication Year: 1989, Page(s):153 - 160
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    The authors describe a novel approach (the macro transform) for solving indecomposable problems, which cannot be decomposed into a sequence of subgoals before they are solved. This kind of problem cannot be solved by either the GPS (general problem solver) or the MPS (macro-operator problem solver). The diamond game is discussed in detail as an example. The proposed approach has also been successf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The infinite distance in the determination of the nearest Euclidean M-neighbours in the K-D-B tree

    Publication Year: 1989, Page(s):146 - 152
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    A search scheme of the nearest m-neighbors in the K -D-B tree structure is proposed. In this scheme, two different strategies for the selection of alternative descent branches, which determine the order in which the criticism of the pruning tree is studied, are devised. An experimental study of this was performed using the infinite distance and Euclidean distanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The NVL knowledge representation language

    Publication Year: 1989, Page(s):368 - 375
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    Semantic networks are described by means of a formal relational logic called NVL. The characteristic features of this logic are limiter lists and binary predicates. Limiter lists are similar to restricted quantifiers but are more expressive. Use is made of several special binary relations to express the key ideas of semantic networks. The formal semantics of NVL is specified, and the soundness of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured matching: a task-specific technique for making decisions

    Publication Year: 1989, Page(s):138 - 145
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The authors describe structured matching informally and give a formal definition of the task and strategy of structured matching. Structured matching integrates the knowledge and control for making a decision within a hierarchical structure. Structured matching has several desirable characteristics: it is qualitative and tractable, it facilitates knowledge acquisition and explanation, and it expli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A technique for knowledge base verification

    Publication Year: 1989, Page(s):399 - 406
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A technique for detecting inconsistencies in, and incompleteness of, a knowledge base is proposed. The technique is based on modeling a knowledge base using a predicate/transition (Pr/T) net representation. Inconsistency and incompleteness patterns in a knowledge base are then defined with respect to the Pr/T net model and are identified by using a syntactic pattern recognition method. This techni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving large scale puzzles with neural networks

    Publication Year: 1989, Page(s):562 - 569
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    The n-queens problem is solved with Boltzmann machines and a depth-first search (DFS) algorithm. In large-scale problems, the Boltzmann machines found a solution much faster than the DFS. The 1000-queens problem was solved using an energy minimization technique. The polyomino puzzles were also solved with Boltzman machines and a DFS algorithm. In small-scale problems, the DFS solved these... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for identification of relations among rules

    Publication Year: 1989, Page(s):360 - 367
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    A representation of a rule-based system is proposed. It is used to define relations among rules. The relations defined are cause-effect, mutual exclusion, redundancy, conflict, subsumption, and implication. A relation between two rules is either complete, i.e. the relation holds for all instantiations of the rules, or partial, i.e. the relation holds only for some instantiations of the rules. An a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multisearch systems with hierarchical control: a tool for solving complex AI problems

    Publication Year: 1989, Page(s):132 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    The authors describe multisearch as a general purpose tool for development and complex AI (artificial intelligence) systems. The multisearch approach expands on abstraction of a search space to a combination of search spaces. Each search is represented as a search template, which is a simple recursive scheme that can call other search templates. Search templates are executed by the search interpre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered inductive learning algorithms and their computational aspects

    Publication Year: 1989, Page(s):448 - 456
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Inductive learning algorithms are based on artificial neural network structures and on the principle of self-organization. The inductive approach is realized by enumerating a large number of equations to choose the best. Linear combinations of inputs are generated in the network and are evaluated according to the changes in response to a comparison with externally fixed criteria, which is adapted ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive DB schema evolution via constrained relationships

    Publication Year: 1989, Page(s):393 - 398
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A novel object-oriented data model and a tailored query language that enables the construction of evolving database (DB) schemas according to the information provided by transaction monitoring are presented. The data model and the query language are based on the notion of constrained relationships that enable interconnections between DB objects under constraints specified by rules. These relations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural network simulation using INES

    Publication Year: 1989, Page(s):556 - 561
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    Describes the Interactive NEtwork Simulation tool (INES), which supports the simulation of multilayer pattern processing. Since the sequence, the interconnections, and the functional characteristics of the layers depend on the ideas and the needs of the user, INES does not assume a special interconnection scheme but makes it possible to set up visually an interconnection scheme of predefined units... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental learning mechanisms for speech understanding

    Publication Year: 1989, Page(s):237 - 243
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The feasibility of using machine-learning techniques to support the development of a speech understanding system is investigated. The research studies the behavior of hidden Markov models as an incremental learning mechanism. The approach is to train whole-word recognizers using a minimal set of training tokens and then incrementally train them as new examples of the words are recognized and added... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A family of cuts for production systems

    Publication Year: 1989, Page(s):353 - 357
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A family of three-cut operations for forward-chaining production systems is defined. These cut operations are specified in terms of their semantics from the expert systems developer point of view and as modifications to the abstract machine underlying forward-chaining systems. Although the presentation utilizes the OPS5 system as a typical forward-chaining system, the definitions are applicable al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A history-based scheme for accelerating Prolog interpretation

    Publication Year: 1989, Page(s):482 - 489
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    An algorithm for improving the performance of a Prolog interpreter is introduced. The algorithm, unlike the intelligent backtracking schemes which improve the performance by avoiding redundant redos, avoids redundant calls. The algorithm identifies the redundant calls by maintaining a history of the program execution. The algorithm can be used in conjunction with an intelligent backtracking scheme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acquisition of knowledge sources for natural language processing

    Publication Year: 1989, Page(s):122 - 129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Tools for facilitating the task of encoding knowledge in developing lexicons and knowledge bases (KBs) are discussed. The specific tools discussed are Lextool (lexicon development tool) and KBtool (knowledge base development tool). These tools, written in Lisp, are the result of an attempt to automate the process of acquiring the data for the benefit of users with varying levels of sophistication.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An entity model for conceptual design

    Publication Year: 1989, Page(s):709 - 716
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    An effort is made to construct an interactive design aid environment with a highly semantic description facility and a logically effective verification facility for increasing software productivity oriented toward reutilization. The proposed method for design simulation is a semantic technique, based on an effective human interface in the entity model constructive process. The system helps human b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel shape coding on SIMD architecture

    Publication Year: 1989, Page(s):534 - 540
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    A parallel shape analysis by simultaneous merging of elementary features detected through calculation of the number of objects within neighboring windows is presented. The parallel algorithm can be embedded on a SIMD (single-instruction, multiple-data) mesh architecture. Elementary image features are detected inside partly overlapping windows fixed in an image plane. Each window content is process... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NSA algorithm and its computational complexity-preliminary results

    Publication Year: 1989, Page(s):442 - 446
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    To overcome the limitations of models of statistical heuristic searching the author proposes the idea of combining nonparametric statistical inference methods with the heuristic search. A nonparametric statistical algorithm (NSA) for heuristic searching is presented, and its computational complexity is discussed. It is shown that, in a uniform m-ary search tree G with a single go... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-level numerical characteristics and inductive learning methodology in texture recognition

    Publication Year: 1989, Page(s):91 - 98
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    A method for applying inductive learning to the texture recognition problem is proposed. The method is based on a three-level generalization for the description of texture classes. The first step, scaling interface, is to transform local texture features into their higher symbolic representation as numerical intervals. The second step is the incorporation of the AQ inductive learning algorithm in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Twin register architecture for an AI processor

    Publication Year: 1989, Page(s):168 - 173
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    A twin register architecture has been developed to improve the backtracking speed of Prolog programs. The twin register architecture is intended to realize a virtual infinite register set. The features of the architecture are: (1) only a small amount of hardware is needed, including a pair of register files, and (2) data transfer between the register and the memory is automatically executed. A reg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FGP: a virtual machine for database-driven expert systems

    Publication Year: 1989, Page(s):388 - 392
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The authors describe FGP, a specification for a virtual machine that makes domain-specific knowledge explicit and brings it to bear on classification and identification problems. The model provides much of the functionality of traditional expert systems without requiring the system builder to preprocess the database into rules, frames, or heuristics. The authors explain the model, describe a parti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing integrated knowledge-based systems

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

    The authors describe tools and methods developed and under development at the Lockheed Artificial Intelligence Center. Particular attention is given to the EVA (expert system validation associate), which consists of a set of tools which check for nonredundancy, consistency, correctness, and completeness of KBSs. These tools, among them EVA's automatic test case generator, are also applicable to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Neural network processing through energy minimization with learning ability to the multiconstraint zero-one knapsack problem

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

    Defines a neural network model NNCO for the multiconstraint zero-one knapsack problem and presents a methodology to solve this problem approximately in near real-time by use of the characteristic that many neural networks can be shown to minimize an energy function defined for the networks. The authors overcome the difficulty that there is not guidance available as to what values the parameters ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel architecture for large scale production systems

    Publication Year: 1989, Page(s):27 - 33
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    The authors present an architecture, suitable for implementation on a shared memory multiprocessor system, in which all the phases can run in parallel. Running multiple match, execution, and select phases causes subtle synchronization problems, which if not resolved can lead to altered semantics. The proposed architecture uses a lock and interference manager and a scheduler to resolve the possible... View full abstract»

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