Journal of the Japanese Society for Artificial Intelligence
Online ISSN : 2435-8614
Print ISSN : 2188-2266
Volume 5 , Issue 3
Showing 1-24 articles out of 24 articles from the selected issue
Print ISSN:0912-8085 until 2013
  • [in Japanese]
    Type: Preface
    1990 Volume 5 Issue 3 Pages 255
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (109K)
  • Makoto AMAMIYA
    Type: Corner article
    1990 Volume 5 Issue 3 Pages 256-265
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (971K)
  • [in Japanese], [in Japanese], [in Japanese], [in Japanese], [in Japane ...
    Type: Cover article
    1990 Volume 5 Issue 3 Pages 266-278
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (1270K)
  • Isamu YAMAZAKI
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 279-290
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    A module D has been established, which has such laws of composition that correspond to sound deductions for predicate logic of first order. One major result of this theory is a new approach to the automated theorem proving, named algebraic proving principle. According to this principle, a set of Horn clauses is unsatisfiable if and only if a linear equation (proof equation) has a nonnegative solution. This implies that the laws of composition are complete as deduction if only Horn clauses are in concern. The elements of D are named sentences. The proof equation has a form which equates a specific sentence with a linear combination of sentences corresponding to the clauses, having the elements of some basic ring R of D as the unknown coefficients. In the case of propositional logic, the proof equation can be reduced to a simultaneous linear equation on Z (integer), and can be solved numerically. But in the case of predicate logic, D is a torsion R-module, and the problem of efficiently solving the proof equation is still open.

    Download PDF (1126K)
  • Masaki SUWA, Hiroshi MOTODA
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 291-299
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    Metaphors are pervasive in speech and thinking activities in our daily life. Understanding a metaphorical sentence means to discover some general metaphors which underlie the sentence. In this paper, we claim that Frustration-Based Learning method (FBL method) can be applied to understanding metaphors. The method has been already proposed as a means of acquiring strategies for producing appropriate auxiliary-lines in auxiliary-line problems in elementary geometry. FBL method has two main concepts ; identification of frustrated states and limited forward reasoning within a restricted world. Identification of frustrated states contributes to discovering where to learn in the whole problem. If a metaphorical sentence is underlied by several general metaphors, several frustrated states are to be identified during the processing of the sentence, and the following learning tasks are performed for each frustrated state ; to suppose the restricted world which has been concerned with the resolution of each frustrated state and then to enumerate all the pieces of information which hold within the world. The latter task is called limited forward reasoning within a restricted world, which directly contributes to discovering underlying information of the sentence, instead of interpreting it superficially. FBL method is based on the concept that learning how frustrated states are resolved in a problem solving process leads to understanding the problem, and its application to metaphors results in understanding a sentence as a composition of several general metaphors.

    Download PDF (864K)
  • Hitoshi IBA, Hirochika INOUE
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 300-310
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    An algebraic approach for geometric reasoning is presented. The purpose of this study is to avoid the usual difficulties which appear in the symbolic approach for machine handling of geometric concepts, such as appropriate representation for transformation-invariant properties of geometric concepts, formal interpretation of heuristics, and finding the tricky auxiliary lines for geometrical problem solving. In order to solve these difficulties we choose Wu's method as the base of our algebraic approach, and have realized an effective geometric reasoning. In this paper, we describe the basic concept of Wu's method, advantages of this algebraic approach, and usefulness for theorem proving. We also show the validity of our approach by applying it to learning-from-example of some heuristic rules in computer vision.

    Download PDF (999K)
  • Hitoshi IBA, Hirochika INOUE
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 311-323
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    A new scheme for geometric reasoning based on the integration of algebraic and symbolic methods is presented. In our previous paper we described advantages of Wu's method as our algebraic approach for geometric reasoning. Although the algebraic approach based on Wu's method is very powerful in geometric reasoning, it has some computational difficulties in algebraic calculations. In order to solve these difficulties, the algebraic method must be augmented with symbolic reasoning for introducing semantics of geometric concepts to algebraic expressions. In this paper, we integrate algebraic and symbolic approaches and thereby realize a new scheme for geometric reasoning. This new scheme incorporates advantages of both algebraic and symbolic methods. In order to show the validity of this scheme, examples of locus problems in geometry are solved by the system which we implemented.

    Download PDF (995K)
  • Kouji IWANUMA, Masateru HARAO
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 324-332
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    Predicates treated as variables, i. e. parameters, in parallel circumscription make it difficult to compute parallel circumscription. Therefore it is very important to develop powerful methods for eliminating parameters. In this paper, we present some parameter elimination methods in parallel circumscription. At first, we show two fundamental theorems for eliminating parameters. Next, we give two parameter elimlnation methods, which are directly derivable from those theorems. One of them is used for eliminating a parameter which occurs only positively or only negatively in a condition sentence of parallel circumscription. Another is a method for eliminating a parameter by replacing it with a formula expressing the minimal or maximal extension of the parameter. These elimination methods are systematic, and can deal with parameters such that they are quantified with both existential and universal quantifiers in the conditlon sentence. The class of parallel circumscription which can be translated into predicate circumscription by these methods is larger than the one by well known Lifschitz's method.

    Download PDF (794K)
  • G. Hiroshi OKUNO
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 333-342
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    The ATMS is widely used in various subfields of AI. Although the ATMS provides more functionalities more efficiently than other justification-based TMS, its still poor performance limits its applications. This paper describes a parallel implementation of the ATMS, called AMI, for a shared-memory multiprocessor to improve its performance. Our implementation introduces a new type of node, called a Justification-node, to the ATMS network. The Justification-node not only gives a source of parallelism, but also provides the means to implement some kinds of hyperresolution and to control the update of the ATMS network. Processing a Justification-node is a good source of parallelism, but there is a large variation in the execution time of the ATMS commands as far as more than twenty trace files of real ATMS applications, e. g., qualitative simulations, are analysed. Hence, we decompose the task into four levels of granularity, from concurrent ATMS commands (i. e. coarse granularity) to concurrent implementations of the ATMS commands (i. e. fine granularity), and control the granularity of parallelism at runtime. Runtime control of granularity is encoded in a parallel Lisp called QLISP, because it enables the user to control the spawning of processes at runtime. The resulting Parallel AMI using 4 processors attains up to 3.5-fold speed-up for benchmarks tried so far.

    Download PDF (918K)
  • Yuichi NAKAMURA, Makoto NAGAO
    Type: Technical paper
    1990 Volume 5 Issue 3 Pages 354-366
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS

    This paper introduces a blackboard system for feature extraction with object oriented programming. In this system various types of feature extraction are integrated into the same framework and their extraction can be performed in parallel. The efficiency was tested in some experiments in which this system was applied to some 2-dimensional objects.

    Download PDF (1159K)
  • [in Japanese]
    Type: Other
    1990 Volume 5 Issue 3 Pages 367
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (112K)
  • [in Japanese]
    Type: Corner article
    1990 Volume 5 Issue 3 Pages 368
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (103K)
  • [in Japanese]
    Type: Corner article
    1990 Volume 5 Issue 3 Pages 369-370
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (163K)
  • [in Japanese]
    Type: Corner article
    1990 Volume 5 Issue 3 Pages 371
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (109K)
  • [in Japanese]
    Type: Corner article
    1990 Volume 5 Issue 3 Pages 372
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (103K)
  • Type: Other
    1990 Volume 5 Issue 3 Pages 373-374
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (198K)
  • Type: Activity report
    1990 Volume 5 Issue 3 Pages 375-379
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (320K)
  • Type: Activity report
    1990 Volume 5 Issue 3 Pages 380-384
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (443K)
  • Type: Activity report
    1990 Volume 5 Issue 3 Pages 385-387
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (232K)
  • Type: Activity report
    1990 Volume 5 Issue 3 Pages 388-389
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (178K)
  • Type: Activity report
    1990 Volume 5 Issue 3 Pages b001-b012
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (726K)
  • Type: Cover page
    1990 Volume 5 Issue 3 Pages c003
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (25K)
  • Type: Cover page
    1990 Volume 5 Issue 3 Pages c003_2
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (61K)
  • Type: Table of contents
    1990 Volume 5 Issue 3 Pages i003
    Published: May 01, 1990
    Released: September 29, 2020
    MAGAZINES FREE ACCESS
    Download PDF (53K)
feedback
Top