Skip to main content
SpringerLink
Log in

Incorporating top-down information into bottom-up hypothetical reasoning

  • Special Issue
  • Invited
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Both bottom-up and top-down approaches have been presented for hypothetical reasoning. However, both have merits and demerits, which are complementary. Thus, hypothetical reasoners combining those approaches are promising. Here, we concern about a bottom-up hypothetical reasoner incorporating top-down information. In order to simulate top-down reasoning on bottom-up reasoners, we can apply the upside-down meta-interpretation method, which is similar to Magic Set and Alexander methods, by transforming a set of Horn clauses into a program incorporating goal information. Unfortunately, it does not achieve speedups for bottom-up hypothetical reasoning because checking consistencies of solutions by negative clauses should be globally evaluated. This paper presents a new method to reduce the consistency checking cost for bottom-up hypothetical reasoning based on the upside-down meta-interpretation. In the transformation algorithm, logical dependencies between a goal and negative clauses are analyzed to find irrelevant negative clauses, so that bottom-up hypothetical reasoning based on the upside-down meta-interpretation can restrict consistency checking of negative clauses to those relevant clauses.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bancilhon, F., Maier, D., Sagiv, Y. and Ullman, J. D., “Magic Sets and Other Strange Ways to Implement Logic Programs,”Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pp. 1–15, 1986.

  2. Beeri, C. and Ramakrishnan, R., “On the Power of Magic,”Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pp. 269–283, 1987.

  3. Bry, F., “Query Evaluation in Recursive Databases: Bottom-Up and Top-Down Reconciled,”Data & Knowledge Engineering, 5, pp. 289–312, 1990.

    Article  Google Scholar 

  4. de Kleer, J., “An Assumption-Based TMS,”Artificial Intelligence, 28, pp. 127–162, 1986.

    Article  Google Scholar 

  5. de Kleer, J., “Problem Solving with the ATMS,”Artificial Intelligence, 28, pp. 197–224, 1986.

    Article  Google Scholar 

  6. Flann, N.S., Dietterich, T.G. and Corpron, D.R., “Forward Chaining Logic Programming with the ATMS,”Proc. AAAI-87, pp. 24–29, 1987.

  7. Forgy, C.L., “Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem,”Artificial Intelligence, 19, pp. 17–37, 1982.

    Article  Google Scholar 

  8. Fujita, H. and Hasegawa, R., “A Model Generation Theorem Prover in KL1 Using a Ramified-Stack Algorithm,”Proc. 8th Int. Conf. Logic Programming, pp. 494–500, 1991.

  9. Inoue, K., “Problem Solving with Hypothetical Reasoning,”Proc. Int. Conf. on Fifth Generation Computer Systems 1988, Tokyo, Japan, pp. 1275–1281, 1988.

  10. Inoue, K., Ohta, Y., Hasegawa, R. and Nakashima, M., “Bottom-Up Abduction by Model Generation,” to appear inProc. IJCAI-93, Chambéry, France, 1993.

  11. Ishizuka, M. and Ito, F., “Fast Hypothetical Reasoning System Using Inference-Path Network,”Proc. 3rd IEEE Int. Conf. on Tools for Artificial Intelligence, San Jose, CA, pp. 1275–1281, 1991.

  12. Junker, U., “Reasoning in Multiple Contexts,”Working Paper 334, GMD, Germany, 1988.

    Google Scholar 

  13. Maruyama, F., Kakuda, T., Masunaga, Y., Minoda, Y., Sawada, S. and Kawato, N., “coLODEX: A Cooperative Expert System for Logic Design,”Proc. Int. Conf. on Fifth Generation Computer Systems 1988, Tokyo, Japan, pp. 1299–1306, 1988.

  14. Ng, H. T. and Mooney, R. J., “An Efficient First-Order Horn-Clause Abduction System Based on the ATMS,”Proc. AAAI-91, pp. 494–499, 1991.

  15. Ohta, Y. and Inoue, K., “A Forward-Chaining Multiple-Context Reasoner and Its Application to Logic Design,”Proc. 2nd IEEE Int. Conf. on Tools for Artificial Intelligence, Herndon, VA, pp. 386–392, 1990.

  16. Ohta, Y. and Inoue, K., “A Forward-Chaining Hypothetical Reasoner Based on Upside-Down Meta-Interpretation,”Proc. Int. Conf. on Fifth Generation Computer Systems 1992, Tokyo, Japan, pp. 522–529, 1992.

  17. Poole, D., Goebel, R. and Aleliunas, R., “Theorist: A Logical Reasoning System for Defaults and Diagnosis,”The Knowledge Frontier: Essays in the Representation of Knowledge (N. Cercone and G. McCalla, eds.), Springer-Verlag, pp. 331–352, 1987.

  18. Poole, D., “Logical Framework for Default Reasoning,”Artificial Intelligence, 36, pp. 27–47, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  19. Poole, D., “Compiling a Default Reasoning System into Prolog,”New Generation Computing, 9, pp. 3–38, 1991.

    Article  MATH  Google Scholar 

  20. Reiter, R., “A Logic for Default Reasoning,”Artificial Intelligence, 13, pp. 81–132, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  21. 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, 4, pp. 273–285, 1986.

    Article  MATH  Google Scholar 

  22. Stickel, M. E., “Rationale and Methods for Abductive Reasoning in Natural-Language Interpretation,”Proc. Int. Scientific Symp. Natural Language and Logic (R. Studer ed.), Hamburg, Germany, 1989,Lecture Notes in Artificial Intelligence, 459, Springer-Verlag, pp. 233–252, 1990.

  23. Stickel, M. E., “Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction,”ICOT Technical Report, TR-664, Institute for New Generation Computer Technology, Tokyo, Japan, 1991.

    Google Scholar 

  24. Ueda, K. and Chikayama, T., “Design of the Kernel Language for the Parallel Inference Machine,”The Computer Journal, 33, 6, pp. 494–500, 1990.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Yoshihiko Ohta

    Present address: Department of Information Engineering, University of Industrial Technology, 4-1-1 Hashimotodai, Sagamihara, 229, Kanagawa, Japan

Authors and Affiliations

  1. Institute for New Generation Computer Technology, ICOT Research Center, Mita Kokusai Bldg., 1-4-28 Mita, Minato-ku, 108, Tokyo, Japan

    Yoshihiko Ohta & Katsumi Inoue

Authors
  1. Yoshihiko Ohta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsumi Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Address after April 1993: Department of Information and Computer Sciences, Toyohashi University of Technology, 1-1 Hibarigaoka, Tempaku-cho, Toyohashi 441, Japan.

Yoshihiko Ohta: Assistant Professor in Department. of Information Engineering, the University of Industrial Technology since 1992. He had been engaged in the Computer Works of Mitsubishi Electric Corporation from 1985 to 1992. He had developed a software tool for building expert systems. He had been transferred to the Institute for New Generation Computer Technology from 1988 to 1992. He has engaged in the research on knowledge-based systems and automated theorem proving. He received bachelor’s degree and master’s degree from Chiba University in 1983 and 1985 respectively.

Katsumi Inoue, Ph. D.: He studied Applied Mathematics and Physics at Faculty of Engineering in Kyoto University. There, he received a Bachelor of Engineering in 1982, a Master of Engineering in 1984, and a Doctor of Engineering in 1993. From 1984 to 1993, he had worked for Matsushita Electric Industrial Co., Ltd. In 1986, he joined Institute for New Generation Computer Technology (ICOT), and had been working as a Senior Researcher for ICOT Research Center until March 1993. In April 1993, he moved to the Department of Information and Computer Sciences, Toyohashi University of Technology. His main research interests include Artificial Intelligence and Logic Programming, in particular automated reasoning and knowledge representation.

About this article

Cite this article

Ohta, Y., Inoue, K. Incorporating top-down information into bottom-up hypothetical reasoning. New Gener Comput 11, 401–421 (1993). https://doi.org/10.1007/BF03037185

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037185

Keywords

Search

Navigation