On the relationship between non-horn magic sets and relevancy testing

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

Volumn 1421, Issue , 1998, Pages 333-348

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

^a Employment Promotion Project Corporation   (Japan)

^b KOBE UNIVERSITY   (Japan)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

COMBINATORIAL EXPLOSION; MAGIC SETS; MODEL GENERATION; PROOF TREE; SEARCH SPACES; THEOREM PROVERS;

THEOREM PROVING;

EID: 84957055273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054270     Document Type: Conference Paper

References (9)

1. Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J.D., Magic sets and other strange ways to implement logic programs, in: Proc. 5th ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 1-15, 1986.
2. Been, C. and Ramakrishnan, R., On the power of magic, J. Logic Programming, 10: 255-299, 1991.
3. Fujita, H. and Hasegawa, R., A model generation theorem prover in KL1 using a ramified-stack algorithm, Proc. 8th Int. Conf. on Logic Programming, pp. 535-548, MIT Press, 1991.
4. Hasegawa, R., Inoue, K., Ohta, Y. and Koshimura, M., Non-Horn magic sets to incorporate top-down inference into bottom-up theorem proving, in: W. McCune (ed.), Proc. 14th Int. Conf. on Automated Deduction (CADE-14), Lecture Notes in Artificial Intelligence, 1249, pp. 176-190, Springer, 1997.
5. Lloyd, J.W., Foundations of Logic Programming, 2nd Edition, Springer, 1987.
6. Loveland, D.W., Reed, D. and Wilson, D.S., SATCHMORE: SATCHMO with RElevancy, J. Automated Reasoning, 14(2): 325-351, 1995.
7. Manthey, R. and Bry, F., SATCHMO: a theorem prover implemented in Prolog, in: E. Lusk and R. Overbeek (eds.), Proc. 9th Int. Conf. on Automated Deduction (CADE-9), Lecture Notes in Computer Science, 310, pp. 415-434, Springer, 1988.
8. Seki, H., On the power of Alexander templates, Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pp. 150-158, 1989.
9. Stickel, M.E., Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction, J. Automated Reasoning, 13(2): 189-210, 1994.