-
[in Japanese]
Article type: Preface
1991 Volume 6 Issue 3 Pages
311
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Cover article
1991 Volume 6 Issue 3 Pages
312-313
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Akira KUREMATSU
Article type: Special issue
1991 Volume 6 Issue 3 Pages
314-320
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Tsuyoshi MORIMOTO
Article type: Special issue
1991 Volume 6 Issue 3 Pages
321-327
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Hitoshi IIDA
Article type: Special issue
1991 Volume 6 Issue 3 Pages
328-337
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Keiichi UENO, Kazunari NAKANE
Article type: Special issue
1991 Volume 6 Issue 3 Pages
338-350
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Shigeru KATAGIRI, Yoh-ichi TOHKURA
Article type: Special issue
1991 Volume 6 Issue 3 Pages
351-357
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Akira TOMONO, Fumio KISHINO
Article type: Special issue
1991 Volume 6 Issue 3 Pages
358-369
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese], [in Japanese], [in Japanese], [in Japanese], [in Japane ...
Article type: Corner article
1991 Volume 6 Issue 3 Pages
370-379
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Takenobu TOKUNAGA, Kentaro INUI
Article type: Corner article
1991 Volume 6 Issue 3 Pages
380-387
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Masami HAGIYA
Article type: Technical paper
1991 Volume 6 Issue 3 Pages
388-396
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
The problem of generalizing explanations or proofs have been studied in the field of explanation-based learning. In this paper, we discuss the use of higher-order unification for solving the problem. We first point out that the problem of generalizing a proof by replacing constant terms with variables can be considered as a matching problem in higher-order type theory, and higher-order unification for terms representing proofs can solve the problem. This method of generalizing a proof has the advantage that it can be naturally extended to cope with the problem of generalizing a proof by introducing induction, also known as the problem of generalizing number. We also discuss the use of recursively reducibility for generalizing equational proofs, particularly computational traces of functions.
View full abstract
-
Mikio YAMAMOTO, Seiichi NAKAGAWA
Article type: Technical paper
1991 Volume 6 Issue 3 Pages
397-406
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
Modal logics are primarily concerned with necessity and possibility, but they can also provide a framework for belief, knowledge, time and so on. Although, in general, only one type of modality has been considered at a time, practical knowledge representation languages of AI systems require to represent and manipulate several modalities at the same time. A unified framework for such systems is called multimodal logics. However, automated reasoning in multimodal logics is made difficult. A language for multimodal logics must provide the facilities to support using heuristics and an efficient reasoning mechanism. The truth maintenance system (TMS) described here can support the reasoning on multimodal logics. It can record justifications for deduced assertions of multimodal logics, track down the assumptions which underlie contradictions, incrementally modify assertional data-base, and calculate the simple deduction about propositional multimodal logics. Our TMS is the extension of McAllester's TMS to multimodal logics. Both his and our TMSs are based on propositional constraint propagation. The difference of them is the objects propagated in TMS. His TMS propagates only truth-value. Our TMS propagates the pair of a truth-value and a set of possible worlds. So our TMS is based on Kripke possible world semantics.
View full abstract
-
Tomoki MARUICHI, Yuichiro ANZAI
Article type: Technical paper
1991 Volume 6 Issue 3 Pages
407-415
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
Temporal knowledge representation and reasoning are important for solving planning, scheduling, discourse understanding and other problems. Many temporal logic models have been proposed for this purpose, but most of them have some disadvantages such as insufficient representability or requirement of a huge amount of time to maintain consistency of represented temporal knowledge. In this paper, we propose a temporal constraint logic model (TCLM). This model,in which representation and consistency maintenance are unified, uses temporal constraint representation. The temporal constraint representation is constructed with event-interval relation, interval constraints, and time-point constraints. Using this representation, both uncertain knowledge and exact knowledge about time can be represented in compact and computationally efficient forms. Consistency in the time knowledge is represented as a network, and maintained using a constraint propagation algorithm. The network consists of nodes which imply time points (corresponding to both ends of intenval) and arcs which imply constraints on time points. The temporal knowledge is dynamically translated into time point constraints and the network is constructed. Whenever new knowledge is added and the network is reconstructed, the constraint propagation algorithm is used to keep consistency. Based on TCLM, a temporal reasoning system (PERIOD) is implemented using ESP. In order to confirm the ability of TCLM, some scheduling and planning problems are solved by PERIOD system.
View full abstract
-
Shigenobu KOBAYASHI, Yasuyuki SHIRAI, Masayuki YAMAMURA
Article type: Technical paper
1991 Volume 6 Issue 3 Pages
416-425
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
Though EBL (explanation based learning) is a useful framework for generating operational knowledge from an example, we must assume perfect domain theory and explicitly defined operationality criterion. This assumption is too severe in practical situation. This paper presents a topdown search over generalization hierarchy of common explanation structure for solving the imperfect theory problem in EBL, forcusing on an inconsistent problem. Common explanation structures are generated from prural primitive explanation structures and they are organized as a generalization hierarchy based on a concept of maximal covering which reflects on similarity among them. By topdown search over the generalization hierarchy, the best set of macro rules, which includes all positive examples and excludes all negatives, can be found. This method has been implemented on Prolog. Some experiments show its usefulness for valid macro rules under the imperfect domain theory.
View full abstract
-
Takashi KIRIYAMA, Tetsuo TOMIYAMA, Hiroyuki YOSHIKAWA
Article type: Technical paper
1991 Volume 6 Issue 3 Pages
426-434
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
Integration of design object models is one of the expected roles of intelligent CAD systems. This paper deals with maintenance of relationships among models. We examine the nature of models and show that knowledge about relationships among background theories is crucial for the integration. Based on this discussion, we propose the metamodel mechanism, a new framework for integrated design object modeling. The idea of the metamodel mechanism is to utilize a qualitative model in order to represent dependency among concepts of which the models consist. The metamodel is refined through the design process by four operations, viz. instantiation, unification, specialization, and delegation. We also show an implementation of the metamodel mechanism.
View full abstract
-
Shinji ARAYA
Article type: Research note
1991 Volume 6 Issue 3 Pages
435-439
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
State saving is a powerful technique to improve the efficiency of pattern matching in production systems. The Rete and the Treat algorithms which both utilize this technique have been experimentally compared but the evaluation has not yet been settled. This paper gives a unifying view to the state saving methods by introducing the concept of "saving level". The change of pattern matching cost against the saving level is qualitatively analyzed and the following results are obtained. (l)The optimal saving level strongly depends upon problem domains. (2) Rete, Treat and no-saving methods have a suitable problem domain respectively. (3) The cost-balancing method is not always effective. Finally, we propose an approach to the saving-level optimization problem.
View full abstract
-
[in Japanese], [in Japanese]
Article type: Other
1991 Volume 6 Issue 3 Pages
440
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Other
1991 Volume 6 Issue 3 Pages
441
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Corner article
1991 Volume 6 Issue 3 Pages
442
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Corner article
1991 Volume 6 Issue 3 Pages
443-444
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Corner article
1991 Volume 6 Issue 3 Pages
445
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Corner article
1991 Volume 6 Issue 3 Pages
447
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Other
1991 Volume 6 Issue 3 Pages
448-449
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Activity report
1991 Volume 6 Issue 3 Pages
450-454
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Activity report
1991 Volume 6 Issue 3 Pages
455-459
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Activity report
1991 Volume 6 Issue 3 Pages
460-462
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Activity report
1991 Volume 6 Issue 3 Pages
463-464
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Corner article
1991 Volume 6 Issue 3 Pages
445_2
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
[in Japanese]
Article type: Corner article
1991 Volume 6 Issue 3 Pages
445_3-446
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Activity report
1991 Volume 6 Issue 3 Pages
b001-b010
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Activity report
1991 Volume 6 Issue 3 Pages
b011-b022
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Cover page
1991 Volume 6 Issue 3 Pages
c003
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Cover page
1991 Volume 6 Issue 3 Pages
c003_2
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Table of contents
1991 Volume 6 Issue 3 Pages
i003
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS
-
Article type: Table of contents
1991 Volume 6 Issue 3 Pages
i003_2
Published: May 01, 1991
Released on J-STAGE: September 29, 2020
MAGAZINE
FREE ACCESS