Skip to main content
SpringerLink
Log in

An efficient abductive reasoning system based on program analysis

  • Conference paper
  • First Online:
Static Analysis (WSA 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 724))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bancilhon, D. Maier, U. Sagiv, and J. D. Ullman. Magic Sets and Other Strange Ways to Implement Logic Programs. In Proc. of Principles of Database Systems, pages 1–15, 1986.

    Google Scholar 

  2. S. Debray, editor. Special Issue:Abstract Interpretation (J. of Logic Programming, Vol. 13, No. 2 & 3). North-Holland, 1992.

    Google Scholar 

  3. A. Kondo and M. Ishizuka. An Efficient Hypothetical Reasoning System for Predicate-logic Knowledge-base. In Proc. IEEE, Int'l Conf. on Tools for AI, San Jose, pages 60–67, 1991.

    Google Scholar 

  4. J.W. Lloyd. Foundations of Logic Programming. Springer, 1984. Second, extended edition, 1987.

    Google Scholar 

  5. H. T. Ng and R. J. Moony. A Efficient First-Order Horn-Clause Abduction Sysem Based on the ATMS. In Proc. of the AAAI-91, pages 494–499, 1991.

    Google Scholar 

  6. Y. Ohta and K. Inoue. An Efficient Inference Method for Forward-chaining Hypothetical Reasoning with the ATMS. J. of ISAI, 7(2):247–259, march 1991. (in japanese).

    Google Scholar 

  7. Y. Ohta and K. Inoue. A Forward-Chaining Hypothetical Reasoner Based on Upside-Down Meta-Interpretation. In Proc. of the International Conference on FGCS '92, pages 522–529, 1992.

    Google Scholar 

  8. D. Poole. A Logical Framework for Default Reasoning. Artificial Intelligence, 36:27–47, 1988.

    Google Scholar 

  9. R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Controlling the search in bottom-up evaluation. In Joint International Conference and Symposium on Logic Programming, pages 273—287, 1992.

    Google Scholar 

  10. B. Selman and H. J. Levesque. Abductive and default reasoning: A computational core. In Proc. of the AAAI-90, pages 343–348, 1990.

    Google Scholar 

  11. M. E. Stickel. Upside-Down Meta-Interpretation of the Model Elimination Theorem-Prover Procedure for Deduction and Abduction. Technical Report TR-664, ICOT, January 1991. TR-664.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of AI and Computer Science, Nagoya Institute of Technology, Gokiso, Showa-ku, 466, Nagoya, Japan

    Shohei Kato, Hirohisa Seki & Hidenori Itoh

Authors
  1. Shohei Kato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hirohisa Seki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hidenori Itoh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrick Cousot Moreno Falaschi Gilberto Filé Antoine Rauzy

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kato, S., Seki, H., Itoh, H. (1993). An efficient abductive reasoning system based on program analysis. In: Cousot, P., Falaschi, M., Filé, G., Rauzy, A. (eds) Static Analysis. WSA 1993. Lecture Notes in Computer Science, vol 724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57264-3_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-57264-3_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57264-0

  • Online ISBN: 978-3-540-48027-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation