|
|
|
| Workshop held on in conjunction with FGCS'94 |
|
| Tokyo, Japan December 15, 1994 |
|
| COVER |
|
Contents |
|
| Invited Talk(1) |
|
| D. W. Loveland |
|
When does a First-order Proof Procedure define a good Logic Programming
Procedure ? |
1 |
| |
|
| N. Yagi, K. Shimazu, K. Furukawa, A. Kimura |
|
| MGTP Application Study to Inductive Logic Programming |
3 |
| |
|
| J. Cheng |
|
| A Relevant Logic Approach to Automated Theorem Finding |
8 |
| |
|
| Invited Talk(2) |
|
| M. E. Stickel, H. Zhang |
|
| First Results of Studying Quasigroup Identities by Rewriting Techniques |
16 |
| |
|
| K. Iwanuma, Y. Chino, H. Ashizawa |
|
| Lemmas with Matching over PTTP: Efficiency and Limitation |
24 |
| |
|
| Invited Talk(3) |
|
| J. Slaney |
|
| High Performance Reasoning Systems: Some Opportunities |
27 |
| |
|
| M. Fujita |
|
| More on quasigroup problems |
31 |
| |
|
| Y. Shirai, R. Hasegawa |
|
| Two Approaches for Finite-Domain Constraint Satisfaction Ploblems |
34 |
| |
|
| Invited Talk(4) |
|
| A. Voronkov |
|
| Implementing Bottom-up Procedures with Code Trees |
39 |
| |
|
| J. Akahani, K. Inoue, R. Hasegawa |
|
| Modal Clause Transformation: A Bottom-up Approach to Modal Theorm Proving |
43 |
| |
|
| A. Ohsuga, K. Sakai, S. Hon-iden |
|
| Refutationally Complete Inference Rules for Inductive Theorem Proving based
on Term Rewiting Techniques |
45 |
