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

兽群

expeditious

0302-9743 presents the constraint logic programming language cu-Prolog, designed for combinatorial problems; the way cu-Prolog solves the constraints is based on program transformation.978-3-540-53919-3978-3-540-46398-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

NOT

Semantics of non-monotonic reasoning based on perfect model,en understood very well. Recently, it has been proposed by C.Przymusinski that perfect model semantics for logic programming is also suitable for some special cases of non-monotonic formalisms. The importance of this result is not only for shedding new light on these two fields, but also for establi

Negotiate

Time-bounded reasoning in first order knowledge base systems,system in the framework of the first order logic, we must overcome this problem..In this paper, we propose a time-bounded reasoning and investigate the properties of the knowledge base management system based on our time-bounded reasoning. We also show that the time-bounded reasoning is sound and va

吗啡

Elementary formal system as a logic programming language,fiers of two atoms is finite and computable by restricting the form of axioms and goals without losing generality. The restriction makes the negation 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

接合

杠杆支点

Parallel generalized LR parser based on logic programming,g table. Considering the compatibility of a breadth-first strategy with parallel processing, we developed a parallel generalized LR parser called PLR, whose algorithm is based on Tomita‘s algorithm. PLR is implemented in GIIC[Ueda 85] that is a concurrent logic programming language developed by the

易改变

Knowledge media station,les users to incorporate and organize this knowledge together with various types of knowledge using a hypermedia framework. Knowledge Media Station consists of a Knowledge Processor, Inference Engine and Hypermedia. In the Inference Engine, we have developed a constraint logic programming language τ

胰脏

cu-Prolog and its application to a JPSG parser,ammar) as a suitable application..cu-Prolog employs . instead of the ordinary unification, and handles symbolic constraints in terms of user-defined predicates. The program clause of cu-Prolog is an expansion of Horn clause and is called .. The constraint satisfaction mechanism of cu-Prolog is based

flammable

Table-driven Bottom Up Parser in Prolog,sition Grammars and idioms and so on..In this paper, we present another speed up method without spoiling these assets. The original BUP has no particular mechanism to choose one production rule deterministically; however, in our method the parser can restrain the nondeterminism by means of an action