Logic programming '88. Proceedings of the 7th conference, Tokyo, Japan, April 11-14, 1988 (Q1801279)

[The articles of this volume will not be indexed individually.] This volume of the Springer Lecture Notes in Computer Science contains most of the papers presented at the 7th Logic Programming Conference (April 1988, Tokyo). The contents cover various aspects of logic programming as foundations, nonmonotonic reasoning, programming languages and systems, concurrent programming, knowledge base and applications of computer-aided reasoning and natural language understanding. Completeness of extended unification based on basic narrowing (A. Yamomoto). The author presents a completeness proof of E-unification based on basic narrowing. Proving definite clauses without explicit use of inductions (A. Sakurai, H. Motoda). The algorithm to prove a definite clause is modeled by an intended minimal model of a set of definite clauses. This algorithm uses no explicit induction scheme and is different from Knuth-Bendix's algorithm. Pseudo extension in default reasoning and belief revision by model inference (H. Yuasa, S. Arikawa). The authors present a generalization of Reiter's extension called pseudo extension. It is the successively constructable set of knowledge constructed from a given default theory. An approach to nonmonotonic inference mechanism in production system KORE/IE (T. Shintani). A method for constructing a mechanism for nonmonotonic inference in KORE\(\setminus IE\) is proposed. In order to realize a nonmonotonic inference the author uses default reasoning and introduces the framework of TMS for resolving contradictions. The mechanism for checking the contradiction can be implemented without using meta programming which is usually used in PROLOG. Nonmonotonic parallel inheritance network (C. Sakama, A. Okumura). This paper discusses a theory of nonmonotonic inheritance reasoning in a semantic network and presents a parallel inheritance algorithm based on this approach. Logic programming debugger using control flow specification (H. Tamura, H. Aiso). A control specification for logic programming and the deterministic trimming method for bug detection are proposed. ALEX: The logic programming language with explicit control and without cut-operators (M. Hoshida, M. Tokoro). A PROLOG-like new programming language is proposed. In ALEX the backtrack mechanism is divided into two categories: ``Recall'' and ``Retry''. ``Recall'' corresponds to ``essential trial and error'' while ``Retry'' corresponds to ``branch on condition''. These actions are controlled by different methods, and ``Recall'' is restricted in default state. Latticeprogramming methodology (K. Fukunaga, S. Morishita). An extension of logic programming is presented. This extension is based on the following connections between logic programming notions and lattice programming notions: \(\{\) true, false\(\}\to\) complete lattice, implication \(\to\) lattice order, and \(\to\) meet \(\to\) functions over complete lattices, or \(\to\) join. A simple programming system written in GHC and its reflective operations (J. Tanaka). A simple programming system is described. The authors' goal is to express a simple programming system more systematically. Implementation of full GHC by communicating processes (M. Terada). An algorithm for interpreting full GHC programs is presented, and an implementation of the algorithm in concurrent Lisp is reported. GHC (Guarded Horn Clauses) is a parallel logic language. Inference methods and semantics on or-type knowledge-bases (H. Sakai). The three valued logic is used for representing or-type knowledge in Horn logic. The fixpoint theorem, soundness and completeness are proved. Access program to minimise redundant refutations on the network database system (M. Takizawa, M. Katsumata, S. Nagahora). This paper presents how to generate access programs which get all answer substitutions from the network database without duplicate refutations from Prolog goal clauses. The authors show an improvement of the Prolog refutation procedure by taking advantage of the network model. EUODHILOS: A general-purpose reasoning assistant system - concept and implementation - (T. Minami, H. Sawamura). A reasoning assistent system is described. It assists the user describing the syntax of the logical expressions and constructing proofs for theorems. Logic based lexical analyser lax (R. Sugimura, K. Akasaka, Y. Kubo, Y. Matsumoto). This paper presents a morphological analysis method which can be executed in parallel and sequential languages. A morphological dictionary is transformed into sequential logic programming languages or parallel programming languages. Extraction of characteristic facts and abstract generation (N. Tamura, T. Kamio, M. Kurosaki). This paper presents a formalization of the summary generation process, which takes a set of observed facts as input and generates its summary in the form of natural language text. Knowledge representation and reasoning for discourse understanding (S. Kinoshita, H. Sano, T. Ukita, K. Sumita, S. Amano). Knowledge representation formalisms - especially frames and scripts - and knowledge representation methods are described.