Titlebook: Logic Programming ‘89; Proceedings of the 8 Koichi Furukawa,Hozumi Tanaka,Tetsunosuke Fujisaki Conference proceedings 1991 Springer-Verlag

Intellectual

carbohydrate

Circumscribe

Time-bounded reasoning in first order knowledge base systems,e properties of the knowledge base management system based on our time-bounded reasoning. We also show that the time-bounded reasoning is sound and valid. Furthermore, we discuss the selection of time functions and give three parameters of time functions. We also outline a prototype system we have realized in K-prolog on a Sun-3.

refine

Elementary formal system as a logic programming language,as failure rule complete. We give two conditions of EFS‘s such that the negation as failure rule is identical to the closed world assumption. We also give a subclass of EFS‘s where a procedure of CWA is given as bounding the length of derivations We compare these classes with the Chomsky hierarchy.

EXALT

BALK

Logic design assistance using temporal logic based language Tokio, the register transfer level are given in the same language: Tokio. This is one of the most outstanding characteristics. In this paper, we mainly present a data path verifier at the register transfer level. This verifier is a core part of the assistance system.

Gene408

直言不讳

Expurgate

Table-driven Bottom Up Parser in Prolog,ammars. The nondeterminism caused by the extension can be managed through the backtracking in the same way as the original BUP. We also present an implementation and experimental results from a practical-sized grammar with 560 production rules.

Confirm