Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1249, Issue , 1997, Pages 176-190

  Hasegawa, Ryuzo ^a   Inoue, Katsumi ^b   Ohta, Yoshihiko ^c   Koshimura, Miyuki ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^c Employment Promotion Project Corporation   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER WORKSTATIONS; LOGIC PROGRAMMING;

BREADTH-FIRST; DEPTH FIRST; FORWARD REASONING; HORN CLAUSE; MAGIC SETS; NATURAL EXTENSION; SOUND AND COMPLETE; TOP-DOWN INFERENCE;

THEOREM PROVING;

EID: 33749549527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_18     Document Type: Conference Paper

References (21)

1. Akahani, J., Inoue, K. and Hasegawa, R.: Bottom-up modal theorem proving based on modal clause transformation, Trans. Information Processing Society of Japan, Vol. 36, No. 4, pp. 822-831 (1995), in Japanese.
2. Arayama, M. and Inoue, K.: Optimizations of query processing for disjunctive deductive databases, Trans. Information Processing Society of Japan, Vol. 37, No. 12, pp. 2295-2304 (1996), in Japanese.
3. Bancilhon, F., Maier, D., Sagiv, Y. and Ullman, J.D.: Magic sets and other strange ways to implement logic programs, Proc. 5th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 1-15 (1986).
4. Beeri, C. and Ramakrishnan, R.: On the power of magic, Proc. Sixth ACM Symp. on Principles of Database Systems, pp. 269-283 (1987).
5. Bry, F.: Query evaluation in recursive databases: bottom-up and top-down reconciled, Data & Knowledge Engineering, Vol. 5, pp. 289-312 (1990).
6. Bry, F. and Yahya, A.: Minimal model generation with positive unit hyperresolution tableaux, Proc. TABLEAUX '96, LNAI 1071, pp. 143-159 (1996).
7. Demolombe, R.: An efficient strategy for non-Horn deductive databases, Theoretical Computer Science, Vol. 78, pp. 245-259 (1991).
8. Loveland, D.W., Reed, D.W. and Wilson, D.S.: SATCHMORE: SATCHMO with RElevancy, J. Automated Reasoning, Vol. 14, No. 2, pp. 325-351 (1995).
9. Hasegawa, R. and Fujita, H.: A model generation theorem prover in KL1 using ramified-stack algorithm, Proc. 8th ICLP, pp. 535-548 (1991).
10. Hasegawa, R., Ohta, Y. and Inoue, K.: Non-Horn magic sets and their relation to relevancy testing, Technical Report ICOT-TR-834, ICOT, Tokyo, (1993).
11. Hasegawa, R.: Parallel theorem-proving system: MGTP, Proc. FGCS'04, pp. 51-65 (1994).
12. Hasegawa, R. and Koshimura, M.: An AND parallelization method for MGTP and its evaluation, Proc. Int. Symp. on PASCO'94, pp. 194-203 (1994).
13. Hasegawa, R. and Fujita, H.: MGTP: a model generation theorem prover in the concurrent logic programming language KL1, Trans. Information Processing Society of Japan, Vol. 37, No. 1, pp. 1-12 (1996), in Japanese.
14. Manthey, R. and Bry, P.: SATCHMO: a theorem prover implemented in Prolog, Proc. CADE-9, LNCS 310, pp.415-434 (1988).
15. Nakashima, H., Nakajima, K., Kondoh S., Takeda Y., Inamura, Y., Onishi, S. and Masuda, K.: Architecture and implementation of PIM/m, Proc. FGCS'92, pp. 425-435 (1992).
16. Ohta, Y., Inoue, K. and Hasegawa, R.: The equivalence between non-Horn magic sets and relevancy testing, submitted for publication (1996), in Japanese.
17. Rohmer, J., Lescoeur, R. and Kerisit, J.M.: The Alexander method - a technique for the processing of recursive axioms in deductive databases, New Generation Computing, Vol. 4, pp. 273-285 (1986).
18. Stickel, M.E.: Upside-down meta-interpretation of the model elimination theorem- proving procedure for deduction and abduction, J. Automated Reasoning, Vol. 13, No. 2, pp. 189-210 (1994).
19. Suttner, C. and Sutcliffe, G: The TPTP problem library, Technical report AR- 94-03, Institut fïïr Informatik, Technische Universität München, Munich, Germany (also available as Technical report 93/11, Department of Computer Science, James Cook University, Townsville, Australia) (1994).
20. Ueda, K. and Chikayama, T.: Design of the kernel language for the parallel inference machine, Computer J., Vol. 33, No. 6, pp. 494-500 (1990).
21. Yahya, A.H.: A goal-driven approach to efficient query processing in disjunctive databases, Research Report PMS-FB-1996-12, Institut für Informatik, Ludwig Maximilians Universität München (1996).