[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence

6-9 Nov. 1990

Filter Results

Displaying Results 1 - 25 of 123
  • Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence (Cat. No.90CH2915-7)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE
  • The state-of-art AI research in Japan

    Publication Year: 1990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (55 KB)

    Summary form only given. The state-of-the-art of artificial intelligence (AI) in Japan is reviewed, and attention given to the current results of the fifth-generation project. The technical aspects of AI research are examined, and the computational power of the fifth-generation computer system compared to that of the current workstation in the use of various AI frameworks. The Japanese rationale f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An inference engine for function free logic programs

    Publication Year: 1990, Page(s):885 - 890
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    The evaluation of function free logic programs by the PROTOS-L system is presented. PROTOS-L is a logic programming language which embeds a module concept, provides read access to external databases and combines order-sorted types with polymorphism. From this viewpoint, PROTOS-L is similar to DATALOG embedded in a typed logic programming language. A small fragment of a travel information system is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing verifiable expert systems

    Publication Year: 1990, Page(s):878 - 884
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    With the long-range goal of developing a practical methodology for complete verification and validation of expert systems, the authors have investigated methods for designing knowledge bases so that they can be easily verified. These methods are based on extensions of traditional software verification technology and on emerging artificial intelligence programming technology. After discussing the b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • P-graph-a graph model for anomaly checking of knowledge bases

    Publication Year: 1990, Page(s):871 - 877
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The authors present a graph model, P-graph, which supports the checking of knowledge bases for anomalies such as deadends, unreachability, cycles, inconsistency, redundancy, subsumption, and missing rules. P-graph captures the essential information needed for anomaly checks. The proposed approach differs from existing research as follows: it checks on groups of problem instances rather than on ind... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A real time control strategy for Bayesian belief networks with application to ship classification problem solving

    Publication Year: 1990, Page(s):738 - 744
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Efficient ways to prioritize and gather evidence within belief networks are discussed. The authors also suggest ways in which one can structure a large problem (a ship classification problem in the present case) into a series of small ones. This both re-defines much of the control strategy into the system structure and also localizes run-time control issues into much smaller networks. The overall ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KNOWBEL: a hybrid expert system building tool

    Publication Year: 1990, Page(s):864 - 870
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    KNOWBEL is a tool offering the knowledge representation language Telos and the logic programming system MRS for the development of an expert system. Telos is a tightly integrated hybrid knowledge representation scheme, offering facilities for structuring a knowledge base as well as an assertional sublanguage for expressing deductive rules and integrity constraints. Unlike Prolog, MRS provides faci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extended framework for evidential reasoning systems

    Publication Year: 1990, Page(s):731 - 737
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Based on the Dempster-Shafer (D-S) theory of evidence and G. Yen's (1989), extension of the theory, the authors propose approaches to representing heuristic knowledge by evidential mapping and pooling the mass distribution in a complex frame by partitioning that frame using Shafter's partition technique. The authors have generalized Yen's model from Bayesian probability theory to the D-S theory of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IXM2: a parallel associative processor for semantic net processing-preliminary evaluation

    Publication Year: 1990, Page(s):667 - 673
    Cited by:  Papers (7)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The authors describe an associative parallel processor, IXM2, for artificial-intelligence applications, using network structured data (e.g., a semantic network). IXM2 consists of 64 associative processors and nine network processors, having a total of 256 Kwords by 40 bits of associative memory. IXM2 uses a novel interconnection mechanism based on complete connection, realizing both high communica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conventional and associative memory-based spelling checkers

    Publication Year: 1990, Page(s):138 - 144
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Conventional and emerging neural approaches to fault-tolerant data retrieval when the input keyword and/or database itself may contain noise (errors) are reviewed. Spelling checking is used as a primary example to illustrate various approaches and to contrast the difference between conventional (algorithmic) techniques and research methods based on neural associative memories. Recent research on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PROFIM: Prolog for image management

    Publication Year: 1990, Page(s):856 - 862
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    It is shown that Prolog can serve as a multi-purpose language in an image management system. With sufficient support routines, Prolog: is interpretive, in order to give immediate response; is programmable, allowing users to compose commands; can update and query the image database; can be used for optimization and constraint rules; and can perform input/output and communications. The architecture ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of interval-valued belief combination with conflicting evidence

    Publication Year: 1990, Page(s):725 - 730
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A novel mathematical procedure for combining conflicting evidence which is represented in the interval form is presented. A methodology to construct combination rules which obey a set of essential properties is proposed. The method is based on a geometric model. The authors compare results obtained from Dempster's rule, the interval Bayes rule, and the proposed combination rule with both conflicti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of DBMS implementations of production systems

    Publication Year: 1990, Page(s):393 - 399
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The performance of various methods for the implementation of large production rule bases is studied. The authors first give a brief overview of the basic techniques, and then present some optimization alternatives for one of them. The results obtained indicate that both the Rete network method and the one based on COND relations are feasible in a relational database system environment. One major a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A massively parallel knowledge-base server using a hypercube multiprocessor

    Publication Year: 1990, Page(s):660 - 666
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    The authors study the parallel implementation of a traditional frame-based knowledge representation system for a general-purpose massively parallel hypercube architecture (such as the Connection Machine). It is shown that, using a widely available parallel system (instead of a special-purpose architecture), it is possible to provide multiple users with efficient shared access to a large-scale know... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema survival rates and heuristic search in genetic algorithms

    Publication Year: 1990, Page(s):322 - 327
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    Genetic algorithms are a relatively new paradigm for search in artificial intelligence. It is shown that, for certain kinds of search problems, called permutation problems, the ordinary rule for intermixing the genes between two organisms leads to longer search chains than are necessary. A schema is a partially completed organism. Its order is the number of fixed components and its length is the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Special purpose array processor implementation of neural networks

    Publication Year: 1990, Page(s):130 - 137
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    A universal digital VLSI design for implementing artificial neural networks is proposed. The design is based on a unified iterative neural network model. An implementation based on a combination of custom-built and commercially available chips is presented. In addition, a software environment for the array processor is discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing deduction from implicit beliefs

    Publication Year: 1990, Page(s):848 - 855
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    An implemented knowledge-based system tool, called JOSIE is presented, that allows specialized representations to be efficiently integrated into a uniform framework. As with previous systems of this type, JOSIE allows different kinds of knowledge to be represented differently. Specialized representations are used to improve an application system's efficiency. One way they gain efficiency is by rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software representation to support change

    Publication Year: 1990, Page(s):593 - 602
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    Research methodology from cognitive science and artificial intelligence is applied to the problem of software representation to support the process of software change. A model of software to support change, suggested by the current research, is presented. Populating that model requires data from tasks related to code-based functional decomposition, data abstraction, and functional data flows. A co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of belief function in hierarchical hypotheses space

    Publication Year: 1990, Page(s):718 - 724
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    It is shown that, in a hierarchically structured hypotheses space, any belief function whose focal elements are nodes in the hierarchy is a separable support function. An algorithm is proposed that decomposes such a separable support function into simple support functions. It is shown that the computational complexity of this decomposition algorithm is O(N2). Applicati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A forward-chaining multiple-context reasoner and its application to logic design

    Publication Year: 1990, Page(s):386 - 392
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The authors present an extended production system architecture which can deal with forward reasoning in multiple contexts. The proposed architecture consists of a compiler of clauses and defaults into a Rete-like network, a Rete-based inference engine, and an assumption-based truth maintenance system (ATMS). The inference engine gives intermediate justifications to the ATMS and stores intermediate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint driven computations in evolving object databases

    Publication Year: 1990, Page(s):167 - 172
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    PROSE, a generic package for maintaining the consistency of object databases using constraint driven computations is discussed. Two original contributions of the package which arose from the meeting of objects and constraints are described. First, due to its reflective implementation, PROSE makes it possible keep consistency not only for the database entities but also for the constraint networks i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool system for knowledge-based on-line diagnosis in industrial automation

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

    A tool system which supports the development of expert systems for use in the field of industrial automation is presented. The knowledge representation language provided by the tool system supports different aspects of knowledge which are important in this domain: the representation of declarative and procedural knowledge; the representation of temporal knowledge; and the representation of knowled... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regularity: generalizing inheritance to arbitrary hierarchies

    Publication Year: 1990, Page(s):625 - 631
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Regularity is formalized from the general observation that hierarchical relationships between concepts reflect relationships between the concepts' properties, and vice-versa. A procedure called expansion is utilized to compute property values when those are not known, based on the patterns of regularity. Inheriting property values in taxonomies is a special case of expansion. Expansion may fail in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved register allocation algorithm for the WAM model

    Publication Year: 1990, Page(s):651 - 657
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    An improved adaptable unification order algorithm is presented. It is used in register allocation for a Warren abstract machine (WAM) Prolog implementation. The algorithm is based on the division of a clause into chunks. The purpose is to generate better Prolog codes for programs so that they have fewer instructions and data movements in execution. It is realized by a good conflict handling algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCA*-a time-constrained approximate A* search algorithm

    Publication Year: 1990, Page(s):314 - 320
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    The authors develop TCA*, a family of problem-independent, time-constrained, approximate A* search algorithms. The algorithms are designed to achieve the best ascertained degree of approximation with the minimum cost under a fixed time constraint, where cost is measured by either the cumulative space-time (CST) product or the maximum space encountered during the search. Only A* searches with admis... View full abstract»

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