Skip to main content

Causes for events: Their computation and applications

  • Deductive Databases, Planning, Synthesis
  • Conference paper
  • First Online:

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

Abstract

A formal definition is presented for the cause for an event with a given knowledge base. An event is understood to be any closed formula; a knowledge base is a set of closed formulae; and a cause is a prenex formula, the matrix of which is a conjunction of literals. The properties of minimality, basicness, consistency and nontriviality are defined to characterise causes that are useful and interesting. An algorithm for computing basic, nontrivial and minimal causes is presented, and its soundness is proved. An extensive example is provided to illustrate the application of causes. In this example is discussed the interaction between the knowledge base, event and causes, and in particular, the property of consistency is used to eliminate ambiguity, and to discover deficiencies of the knowledge base.

This research was supported by NSERC Grants A0124 and A2493

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buchanan, B.G.; Shortliffe, E.H. (eds), Rule-Based Expert Systems, Addison-Wesley (1984).

    Google Scholar 

  2. Colmerauer, A. et al., Prolog II: Reference Manual and Theoretical Model, Groupe d'Intelligence Artificielle, Faculte des Sciences de Luminy, Marseille (1982).

    Google Scholar 

  3. Cox, P.T.; Pietrzykowski, T., A Complete Nonredundant Algorithm for Reversed Skolemization, Theoretical Comp. Science 28, (1984), 239–261.

    Article  Google Scholar 

  4. Cox, P.T.; Pietrzykowski, T., Surface Deduction: a uniform mechanism for logic programming, Proc. 1985 Logic Prog. Symp., Boston (1985), 220–227.

    Google Scholar 

  5. Loveland, D.W., A linear format for resolution, Lectures in Mathematics 1–5 (Symp. on Autom. Demonstration), Springer-Verlag, Berlin (1970), 147–162.

    Google Scholar 

  6. McCarthy, J., Circumscription — A Form of Non-monotonic Reasoning, Artificial Intelligence Journal v.3, no.s 1&2 (1980), 27–40.

    Article  Google Scholar 

  7. McDermott, D.; Doyle, J. Non-monotonic Logic I, Artificial Intelligence Journal v.3, no.s 1&2 (1980), 41–72.

    Article  Google Scholar 

  8. Pietrzykowski, T., Mechanical Hypothesis Formation, Res. Rept. CS-78-33, Department of Computer Science, University of Waterloo (1978).

    Google Scholar 

  9. Reiter, R., A Logic for Default Reasoning, Artificial Intelligence Journal v.3, no.s 1&2 (1980), 81–132.

    Article  Google Scholar 

  10. Shortliffe, E.H., Computer-Based Medical Consulation: MYCIN, American Elsevier, New York (1976).

    Google Scholar 

  11. van Emden, M.H.; Lloyd, J.W., A Logical Reconstruction of Prolog II, Proc. 2 nd Int'l. Conf. on Logic Prog. Uppsala (1984), 35–40.

    Google Scholar 

  12. Zadeh, L.A., Approximate Reasoning Based on Fuzzy Logic, Proc. IJCAI-79, Tokyo (1979), 1004–1010.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cox, P.T., Pietrzykowski, T. (1986). Causes for events: Their computation and applications. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_125

Download citation

  • DOI: https://doi.org/10.1007/3-540-16780-3_125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16780-8

  • Online ISBN: 978-3-540-39861-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics