Advertisement

A polynomial-time predicate-logic hypothetical reasoning by Networked Bubble Propagation method

  • Yukio Ohsawa
  • Mitsuru Ishizuka
Knowledge Representation V: Search
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1081)

Abstract

Hypothetical reasoning is a useful knowledge-processing framework applicable to many problems including system diagnosis, design, etc. However, due to its non-monotonic inference nature, it takes exponential computation-time to find a solution hypotheses-set to prove a given goal. This is also true for cost-based hypothetical reasoning to find an optimal solution with minimal cost. As for the hypothetical reasoning expressed in propositional logic, since it is easily transformed into 0–1 integer programming problem, a polynomial-time method finding a near-optimal solution has been developed so far by employing an approximate solution method of 0–1 integer programming called the Pivot and Complement method. Also, by reforming this method, a network-based inference mechanism called Networked Bubble Propagation (NBP) has been invented by the authors, which allows even faster inference. More importantly, a network-based approach is meaningful, for its potential of being developed extending to a broader framework of knowledge processing. In this paper, we extend the NBP method to dealing with the hypothetical reasoning expressed with predicate logic. By constructing a series of knowledge networks, to which the NBP method is applied, in a stepwise manner according to a top-down control, we avoid the excessive expansion of the network size. As a result, we can achieve a polynomial-time inference for computing a near-optimal solution for the cost-based hypothetical reasoning in predicate-logic knowledge.

Keywords

Reasoning (abduction) Knowledge Representation Search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Poole, D., Aleliunas, R. and Goebel, R.: Theorist: A Logical Reasoning System for Defaults and Diagnosis, in the Knowledge Frontier: Essays in the Knowledge Representation (Cereone, N. J. and Macalla, G., eds.) Springer-Verlag, N.Y., 1987.Google Scholar
  2. 2.
    Kautz, H.A and Selman, B.: Hard Problems for Simple Default Logics, Proc. 1st Int'l Conf. on Principles of Knowldge Representation and Reasoning, 189–197, 1989.Google Scholar
  3. 3.
    Bylander, T., Allemang, D., et al.: The Computational Complexity of Abduction, Artif. Intell., Vol. 49, 25–60, 1991.Google Scholar
  4. 4.
    Kondo, A. Makino, T. and Ishizuka, M.: Efficient Hypothetical Reasoning System for Predicate-logic Knowledge Base, Knowledge Based Systems, Vol. 6, 87–94, 1993.Google Scholar
  5. 5.
    Vieille, L.: Recursive Axioms in Deductive Databases: The Query/Subquery Approach, Proc. Expert Database Systems, 253–267, 1987.Google Scholar
  6. 6.
    de Kleer, J.: An Assumption-based TMS, Artif. Intell, Vol. 28, 127–162, 1986.Google Scholar
  7. 7.
    Inoue, K., Ohta, Y. and Hasegawa, R.: Hypothetical Reasoning Systems on the MGTP, ICOT Technical Report, TR-763, 1992.Google Scholar
  8. 8.
    Ishizuka, M. and Ito, F.: Fast Hypothetical Reasoning System using Inference-Path Network, Proc. IEEE Int'l Conf. Tools for AI '91, 352–360, 1991.Google Scholar
  9. 9.
    Bry, F.: Query evalution in recursive databases, bottom-up and top-down reconciled, Data and Knowledge Engineering, Vol. 5, 289–312, 1990.Google Scholar
  10. 10.
    Charniak, E. and Shimony, S.E.: Probabilistic Semantics for Cost Based Abduction, Proc. AAAI'90, 106–111, 1990.Google Scholar
  11. 11.
    Balas, E. and Martin, C.: Pivot and Complement — A Heuristic for 0–1 Programming, Management Science, Vol. 26, 86–96, 1980.Google Scholar
  12. 12.
    Ishizuka, M. and Okamoto, T.: A Polynomial-time Hypothetical Reasoning employing an Approximate Method of 0–1 Integer Programming for Computing Nearoptimal Solution, Proc. 10th Canadian Conf. AI, 179–186, 1994.Google Scholar
  13. 13.
    Ohsawa, Y., Ishizuka, M.: Networked Bubble Propagation Method as a Polynomial-time Hypothetical Reasoning for Computing Quasi-optimal Solution, Proc. IEEE Int'l Conf. Tools with AI (TAI'93), 184–187, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Yukio Ohsawa
    • 1
  • Mitsuru Ishizuka
    • 2
  1. 1.Dept. of Systems Eng.Osaka UniversitysOsakaJapan
  2. 2.Dept. of Information and Communication Eng.University of TokyoTokyoJapan

Personalised recommendations