Skip to main content
SpringerLink
Log in

A Note on the Least Informative Model of a Theory

  • Conference paper
Programs, Proofs, Processes (CiE 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6158))

Included in the following conference series:

Abstract

We consider one possible interpretation of the ‘least informative model’ of a relational and finite theory and show that it is well defined for a particular class of Π1 theories. We conjecture that it is always defined for Π1 theories.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bacchus, F., Grove, A.J., Halpern, J.Y., Koller, D.: Generating new beliefs from old. In: de Mantaras, R.L., Poole, D. (eds.) Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, pp. 37–45. Morgan Kaufman, San Fransisco (1994)

    Google Scholar 

  2. Bacchus, F., Grove, A.J., Halpern, J.Y., Koller, D.: From statistical knowledge to degrees of belief. Artificial Intelligence 87, 75–143 (1996)

    Article  MathSciNet  Google Scholar 

  3. Balogh, J., Bollobas, B., Weinreich, D.: The penultimate range of growth for graph properties. European Journal of Combinatorics 22(3), 277–289 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Barnett, O.W., Paris, J.B.: Maximum Entropy inference with qualified knowledge. Logic Journal of the IGPL 16(1), 85–98 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  5. Compton, K.J.: A Logical Approach to Asymptotic Combinatorics I. First Order Properties. Advances in Mathematics 65, 65–96 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Compton, K.J.: 0-1 Laws in Logic and Combinatorics. In: Rival, I. (ed.) Proc. 1987 NATO Adv. Study Inst. on Algorithms and Order. Reidel, Dordrecht (1988)

    Google Scholar 

  7. Fagin, R.: Probabilities on Finite Models. Journal of Symbolic Logic 41, 50–58 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gaifman, H.: Concerning measures in first order calculi. Israel J. of Mathematics 24, 1–18 (1964)

    Article  MathSciNet  Google Scholar 

  9. Glebskiĭ, Y.V., Kogan, D.I., Liogon’kiĭ, M.I., Talanov, V.A.: Range and Degree of Formulas in the Restricted Predicate Calculus. Cybernetics 5, 142–154 (1972)

    Google Scholar 

  10. Grove, A.J., Halpern, J.Y., Koller, D.: Random Worlds and Maximum Entropy. Journal of Artificial Intelligence Research 2, 33–88 (1994)

    MATH  MathSciNet  Google Scholar 

  11. Grove, A.J., Halpern, J.Y., Koller, D.: Asymptotic conditional probabilities: the unary case. SIAM Journal of Computing 25(1), 1–51 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Grove, A.J., Halpern, J.Y., Koller, D.: Asymptotic conditional probabilities: the non-unary case. Journal of Symbolic Logic 61(1), 250–276 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lynch, F.J.: An Extension of 0-1 Laws. Random Structures and Algorithms 5(1), 155–172 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Mendelson, E.: Introduction to Mathematical Logic, 4th edn. International Thompson Publishing (1997)

    Google Scholar 

  15. Paris, J.B., Rad, S.R.: Inference Processes for Quantified Predicate Knowledge. In: Hodges, W., de Queiroz, R. (eds.) Logic, Language, Information and Computation. LNCS (LNAI), vol. 5110, pp. 249–259. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Paris, J.B., Vencovská, A.: A Note on the Inevitability of Maximum Entropy. International Journal of Approximate Reasoning 4(3), 183–224 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  17. Paris, J.B., Vencovská, A.: Common sense and stochastic independence. In: Corfield, D., Williamson, J. (eds.) Foundations of Bayesianism, pp. 203–240. Kluwer Academic Press, Dordrecht (2001)

    Google Scholar 

  18. Rad, S.R.: Inference Processes For Probabilistic First Order Languages. Ph.D. Thesis, University of Manchester (2009), http://www.maths.manchester.ac.uk/~jeff/

  19. Scheinerman, E.R., Zito, J.: On the size of hereditary classes of graphs. Journal Combinatorial Theory, Ser. B 61, 16–39 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press (1949)

    Google Scholar 

  21. Shore, J.E., Johnson, R.W.: Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy. IEEE, Trans. Info. Theory IT-26, 26–37 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  22. Vencovská, A.: Binary Induction and Carnap’s Continuum. In: Proceedings of the 7th Workshop on Uncertainty Processing (WUPES), Mikulov (2006), http://www.utia.cas.cz/MTR/wupes06_papers

  23. Williamson, J.: Objective Bayesian Probabilistic Logic. Journal of Algorithms in Cognition. Informatics and Logic 63, 167–183 (2008)

    MATH  Google Scholar 

  24. Woods, A.R.: Counting Finite Models. Journal of Symbolic Logic 62(1), 925–949 (1995)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, The University of Manchester, Manchester, M13 9PL

    Jeff B. Paris & Soroush R. Rad

Authors
  1. Jeff B. Paris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Soroush R. Rad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Matemática, Universidade de Lisboa, Campo Grande, Edifício C6, 1749-016, Lisboa, Portugal

    Fernando Ferreira

  2. Institute for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, P.O. Box 94242, 1090, Amsterdam, GE, The Netherlands

    Benedikt Löwe

  3. Departamento de Informática e Ingeniería de Sistemas, Universidad de Zaragoza, María de Luna 1, 50018, Zaragoza, Spain

    Elvira Mayordomo

  4. Universidade dos Açores, Campus de Ponta Delgada, Apartado 1422, 9501-801, Ponta Delgada, Açores, Portugal

    Luís Mendes Gomes

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paris, J.B., Rad, S.R. (2010). A Note on the Least Informative Model of a Theory. In: Ferreira, F., Löwe, B., Mayordomo, E., Mendes Gomes, L. (eds) Programs, Proofs, Processes. CiE 2010. Lecture Notes in Computer Science, vol 6158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13962-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13962-8_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13961-1

  • Online ISBN: 978-3-642-13962-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation