Skip to main content

Informational logic for automated reasoning

  • Belief Revision and Paraconsistency
  • Conference paper
  • First Online:
  • 125 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1126))

Abstract

A logical entropy based Informational Logic is presented which provides new tools for probabilistic automated reasoning and knowledge representation. Applications in automated theorem proving are shown and a Decision Theory for probabilistic theorems is proposed.

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. J. Avenhaus and K. Madlener. Term rewriting and equational reasoning. In Formal Techniques in Artificial Intelligence, pages 1–43. North-Holland, Amsterdam, 1990.

    Google Scholar 

  2. R. S. Boyer and J. S. Moore. Proving theorems about lisp functions. JACM, pages 129–144, 1975.

    Google Scholar 

  3. D. Dubois, J. Lang, and H. Prade. Possibilistic logic. In J. A. Robinson Dov M. Gabbay, C. J. Hogger, editor, Handbook of Logic in AI and Logic Programming. Clarendon Press, Oxford, 1994.

    Google Scholar 

  4. P. Forcheri, P. Gentilini, and M. T. Molfino. Research in automated deduction as a basis for a probabilistic proof-theory. In P. Agliano' and A. Ursini, editors, Logic and Algebra, pages 491–528. Dekker, New York, 1996.

    Google Scholar 

  5. R. Gallager. Information Theory and Reliable Communication. John Wiley and Sons, New York, 1968.

    Google Scholar 

  6. P. Gentilini. Provability logic in the Gentzen formulation of arithmetic. Z. Math. Log. Grundlagen. Math., 38:536–550, 1992.

    Google Scholar 

  7. P. Gentilini. Informational proof-theory. In Centro F. Enriquez, editor, Proceedings of International Conference on Logic Methodology and Philosophy of Science, page 47. Florence, 1995.

    Google Scholar 

  8. J.Y. Girard. Linear logic. TCS, 50:1–102, 1987.

    Article  Google Scholar 

  9. A. I. Khinchin. Mathematical Foundations of Information Theory. Dover Publications, New York, 1957.

    Google Scholar 

  10. J. Krajicek and P. Pudlak. The number of proof lines and the size of proofs in first order logic. Archive for Mathematical Logic, pages 69–84, 1988.

    Google Scholar 

  11. H. E. Kyburg. Uncertainty logics. In J. A. Robinson Dov M. Gabbay, C. J. Hogger, editor, Handbook of Logic in AI and Logic Programming,vol.3. Clarendon Press, Oxford, 1994.

    Google Scholar 

  12. R. J. Parikh. Some results on the length of proofs. Trans. of Am. Math. Soc, 177:29–36, 1973.

    Google Scholar 

  13. D. Perlis and V. S. Subrahmanian. Meta-languages, reflection principles and self-reference. In J. A. Robinson Dov M. Gabbay, C. J. Hogger, editor, Handbook of Logic in AI and Logic Programming, vol.2. Clarendon Press, Oxford, 1994.

    Google Scholar 

  14. C. Smorynski. The incompleteness theorems. In Barwise, editor, Handbook of Mathematical Logic. North Holland, Amsterdam, 1977.

    Google Scholar 

  15. G. Takeuti. Proof Theory. North-Holland, Amsterdam, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Jülio Alferes Luís Moniz Pereira Ewa Orlowska

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Forcheri, P., Gentilini, P., Molfino, M.T. (1996). Informational logic for automated reasoning. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds) Logics in Artificial Intelligence. JELIA 1996. Lecture Notes in Computer Science, vol 1126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61630-6_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-61630-6_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61630-6

  • Online ISBN: 978-3-540-70643-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics