Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

[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
  • 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.
  • Sharing the components of transposition-invariant distance, DIT, on DIT-organized Burkhard-Keller structure in searches for best matching strings

    Publication Year: 1989, Page(s):435 - 441
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Various construction approaches for character/frequency information sharing structures are proposed to optimize transportation-invariant distance evaluation. An approach for Burkhard-Keller tree construction according to the sharing structure is proposed. Experimental results are presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Match Box: fine-grained parallelism at the match level

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

    Introduces Match Box, an incremental matching algorithm for determining the tuple instantiations of forward-chaining production rules. Match Box is rooted in the mathematical interconnections between tuple and binding spaces, a framework also applicable to other pattern matching algorithms. The idea is to precompare a rule's binding space and then have each binding independently monitor working me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of the W/AGE CASE tool in artificial intelligence

    Publication Year: 1989, Page(s):321 - 329
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    The authors give two examples of the use of a novel approach for building input language processing intensive programs in a lazy pure functional programming language. The proposed approach relies on a CASE (computer-aided software engineering) tool called W/AGE (Windsor attribute grammar environment) which facilitates the construction of programs as executable attribute grammars View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation

    Publication Year: 1989, Page(s):420 - 427
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    Considers the use of a partial consistency, issuing from relational database theory, within the constraint-satisfaction problems (CSPs) framework, i.e., pairwise consistency. This partial consistency concerns general CSPs (i.e., CSPs the constraints of which may involve more than two variables). The authors provide a polynomial algorithm for achieving this consistency; then they extend the class o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • I-see: an AI-tool for image understanding

    Publication Year: 1989, Page(s):314 - 320
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A software environment that supports the implementation of image understanding applications is described. The environment, called I-see, is implemented on top of the object-oriented KEE system and focuses on the iconic representation and exploration of visual data. The system offers an interface between the high-level symbolic reasoning mechanisms of KEE and the raw image data and iconically repre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource-oriented parallel planning

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

    A new paradigm for constructing a partially ordered plan network, referred to as resource-oriented parallel planning (RP2), is presented. In resource-oriented parallel planning, goal states are grouped into a collection of goal state subsets, each of which consists of those goal states associated with a particular resource. A subplan is generated for each goal state subset by planning t... 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.
  • A frame and rule based system to support software development using an integrated software engineering paradigm

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

    A software system that uses the concepts of frames and production rules to support software development using an integrated software engineering paradigm is presented. This system includes a frame-and-rule oriented requirements language (FRORL), a predominance/particular methodology, and a knowledge base. FRORL uses frame representation for object-oriented modeling, applies production rules for sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature extraction from speech spectrograms using multi-layered network models

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

    The authors propose a method for capturing speaker-invariant features from speech spectrograms using artificial neural network (ANN) models. Feature extraction was carried out using the recognition network model, a biologically based pattern recognition system capable of recognizing images that are distorted or shifted in position. It is a three-layer network system. The initial layer of the netwo... 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.
  • Associative recall based on abstract object descriptions learned from observation: the CBM neural net model

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

    The associative recall problem is treated by means of a novel neural net model. The classifier-based model (CBM) uses internal representations of objects automatically developed from observation. A feedback loop consisting of a Coulomb network is introduced into a classifier network. The classifier learns descriptions of various object types from observation of typical instances. The internal repr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using structural and procedural knowledge in database and knowledge base integration

    Publication Year: 1989, Page(s):407 - 417
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    Elaborates on an architectural frameworks for the integration of a number of preexisting data repositories. This sort of integration preserves the autonomy of the local applications while providing a uniform and consistent model of access. The authors also propose a modeling facility to simulate the functionalities of the proposed architecture and cope with representation problems stemming from th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The intelligent system server: delivering AI to complex systems

    Publication Year: 1989, Page(s):306 - 313
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The authors describe work on the design of an intelligent system server, a distributed architecture for delivering knowledge representation and reasoning services to applications. This work is based on two simple ideas. The first is that knowledge bases are like databases and their services should be provided in a similar manner-in a client-server relationship. The second idea is that a convenient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A modified A* algorithm for robust plan recognition

    Publication Year: 1989, Page(s):36 - 42
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    It is shown that the A* algorithm can be directly applied to the basic plan recognition problem while keeping its desirable properties of admissibility and the possibility of polynomial runtime. Two relatively minor modifications can extend the robustness by allowing the algorithm to recognize situations in which the user has an incorrect plan. Four algorithms are presented, starting with a direct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of knowledge in an active information environment

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

    Some innovative concepts which influence the design and development of active information systems are presented. The data representation, reasoning, and language facilities for an active information system are presented. It is argued that the notion of knowledge and metaknowledge improves the overall system functionality by supporting the user during the process of problem solving and by providing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On transformation of logic specifications into procedural programs

    Publication Year: 1989, Page(s):274 - 281
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic. This transformation method is aimed at removing certain types of nondeterministic in a H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge based invocation of software methods and tools

    Publication Year: 1989, Page(s):499 - 510
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    Software engineering is in transition from a purely manual approach to an automated procedure, where computer-aided handling of models, methods, and tools is required. The divide-and-conquer principle is applied to theory-free areas such as method description, tool selection, quality and productivity modeling, and code instrumentation to allow production rules to capture the knowledge about the pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Current and future trends in artificial intelligence architectures and programming languages

    Publication Year: 1989, Page(s):215 - 221
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    LISP and four procedural HLPLs (high-level programming languages) are evaluated in terms of their suitability, based on execution efficiency, for coding AI-related problems. The Micro-VAX II is the target machine for this evaluation. Ada and C were found to be suitable HLPLs for coding AI-related problems that are to be executed on conventional machines. It is noted that the solutions to execution... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent machine translation using a contextual knowledge representation

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

    A contextual knowledge representation is introduced to propose a variety of expressions (i.e. skeleton, paraphrase, diagram, etc.) of a target language in an intelligent machine translation system. This contextual knowledge representation is supported by two methodologies. One is a coherent analysis using explicit and implicit clue words. These clues can suggest important expressions to be summari... 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.
  • 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.
  • The role of learning in logic synthesis

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

    A model of logic synthesis that uses technology-specific design rules and extends rule-based search to functional decomposition and technology mapping is proposed. The problem of technology independence is addressed with the addition of a model of learning for automating the generation of design rules. While this model improves design quality by taking advantage of the target technology, it is not... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 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.