Quantitative Logic Reasoning

  • Marcelo FingerEmail author
Part of the Trends in Logic book series (TREN, volume 47)


In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous properties hold throughout that class, for whose members there exists a set of linear algebraic techniques applicable in the study of satisfiability decision problems. In this presentation, we consider as Quantitative Logic Reasoning the tasks performed by propositional Probabilistic Logic; first-order logic with counting quantifiers over a fragment containing unary and limited binary predicates; and propositional Łukasiewicz Infinitely-valued Probabilistic Logic.



We are very thankful to Daniele Mundici for several discussions on multi-valued logics; we would also like to thank two reviewers for their very detailed comments. This work was supported by Fapesp projects 2015/21880-4 and 2014/12236-1 and CNPq grant PQ 306582/2014-7.


  1. 1.
    Andersen, K., and D. Pretolani. 2001. Easy cases of probabilistic satisfiability. Annals of Mathematics and Artificial Intelligence 33 (1): 69–91.CrossRefGoogle Scholar
  2. 2.
    Baader, F., M. Buchheit, and B. Hollander. 1996. Cardinality restrictions on concepts. Artificial Intelligence 88 (1): 195–213.CrossRefGoogle Scholar
  3. 3.
    Baader, F., S. Brandt, and C. Lutz. 2005. Pushing the EL envelope. In IJCAI05, 19th International Joint Conference on Artificial Intelligence, pp. 364–369.Google Scholar
  4. 4.
    Bertsimas, D., and J.N. Tsitsiklis. 1997. Introduction to Linear Optimization. Athena Scientific.Google Scholar
  5. 5.
    Biere, A. 2014. Lingeling essentials, a tutorial on design and implementation aspects of the the sat solver lingeling. In POS@ SAT, pp.  88. Citeseer.Google Scholar
  6. 6.
    Bona, G.D., and M. Finger. 2015. Measuring inconsistency in probabilistic logic: rationality postulates and dutch book interpretation. Artificial Intelligence 227: 140–164.CrossRefGoogle Scholar
  7. 7.
    Bona, G.D., F.G. Cozman, and M. Finger. 2014. Towards classifying propositional probabilistic logics. Journal of Applied Logic 12(3):349–368. Special Issue on Combining Probability and Logic to Solve Philosophical Problems.CrossRefGoogle Scholar
  8. 8.
    Boole, G. 1854. An Investigation on the Laws of Thought. London: Macmillan. Available on project Gutemberg at
  9. 9.
    Bova, S., and T. Flaminio. 2010. The coherence of Łukasiewicz assessments is NP-complete. International Journal of Approximate Reasoning 51 (3): 294–304.CrossRefGoogle Scholar
  10. 10.
    Bulatov, A.A., and A. Hedayaty. 2015. Galois correspondence for counting quantifiers. Multiple-Valued Logic and Soft Computing 24 (5–6): 405–424.Google Scholar
  11. 11.
    Calvanese, D., G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati (2005). DL-Lite: Tractable description logics for ontologies. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), vol.  5, pp. 602–607.Google Scholar
  12. 12.
    Cignoli, R., I. d’Ottaviano, and D. Mundici. 2000. Algebraic Foundations of Many-Valued Reasoning, Trends in Logic. Netherlands: Springer.CrossRefGoogle Scholar
  13. 13.
    de Finetti, B. 1931. Sul significato soggettivo della probabilità. Fundamenta Mathematicae 17(1): 298–329. Translated into English as “On the Subjective Meaning of Probability”. In Probabilitàe Induzione, ed. P. Monari, and D. Cocchi, 291–321. Bologna: Clueb (1993).Google Scholar
  14. 14.
    de Finetti, B. 1937. La prévision: Ses lois logiques, ses sources subjectives. In Annales de l’institut Henri Poincaré, vol. 7:1, pp. 1–68. English translation by Henry E. Kyburg Jr., as “Foresight: Its Logical Laws, its Subjective Sources.” In H. E. Kyburg Jr., and H. E. Smokler, “Studies in Subjective Probability”, J. Wiley, New York, pp. 93–158, 1964. Second edition published by Krieger, New York, pp. 53–118, 1980.Google Scholar
  15. 15.
    de Finetti, B. 2017. Theory of probability: A critical introductory treatment. Translated by Antonio Machí and Adrian Smith. Wiley.Google Scholar
  16. 16.
    Eckhoff, J. 1993. Helly, Radon, and Carathéodory type theorems. In Handbook of Convex Geometry, Edited by P.M. Gruber, and J.M. Wills, pp. 389–448. Elsevier Science Publishers.Google Scholar
  17. 17.
    Eén, N. and N. Sörensson. 2003. An extensible SAT-solver. In SAT 2003, vol. 2919 LNCS, pp. 502–518. Springer.Google Scholar
  18. 18.
    Eén, N., and N. Sörensson. 2006. Translating pseudo-boolean constraints into sat. Journal on Satisfiability, Boolean Modeling and Computation 2 (1–4): 1–26.Google Scholar
  19. 19.
    Fagin, R., J.Y. Halpern, and N. Megiddo. 1990. A logic for reasoning about probabilities. Information and Computation 87: 78–128.CrossRefGoogle Scholar
  20. 20.
    Finger, M., and G.D. Bona. 2011. Probabilistic satisfiability: Logic-based algorithms and phase transition. In Internatioinal Joint Congerence on Artificial Intelligence (IJCAI), Edited by T. Walsh, pp. 528–533. IJCAI/AAAI Press.Google Scholar
  21. 21.
    Finger, M., and G.D. Bona. 2017. Algorithms for deciding counting quantifiers over unary predicates. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4–9, 2017, San Francisco, California, USA., Edited by S.P. Singh, and S. Markovitch, pp. 3878–3884. AAAI Press.Google Scholar
  22. 22.
    Finger, M., and G. De Bona. 2015. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. Annals of Mathematics and Artificial Intelligence 75 (3): 351–379.CrossRefGoogle Scholar
  23. 23.
    Finger, M., and S. Preto. 2018. Probably half true: Probabilistic satisfiability over Łukasiewicz infinitely-valued logic. In preparation.Google Scholar
  24. 24.
    Georgakopoulos, G., D. Kavvadias, and C.H. Papadimitriou. 1988. Probabilistic satisfiability. Journal of Complexity 4 (1): 1–11.CrossRefGoogle Scholar
  25. 25.
    Grädel, E., and M. Otto. 1999. On logics with two variables. Theoretical Computer Science 224 (1): 73–113.CrossRefGoogle Scholar
  26. 26.
    Grädel, E., P.G. Kolaitis, and M.Y. Vardi. 1997. On the decision problem for two-variable first-order logic. The Bulletin of Symbolic Logic 3 (1): 53–69.CrossRefGoogle Scholar
  27. 27.
    Hailperin, T. 1986. Boole’s Logic and Probability (Second enlarged edition ed.), vol.  85 Studies in Logic and the Foundations of Mathematics. Amsterdam: North-Holland.Google Scholar
  28. 28.
    Hansen, P., and B. Jaumard. 2000. Probabilistic satisfiability. In Handbook of Defeasible Reasoning and Uncertainty Management Systems, Edited by J. Kohlas, and S. Moral, vol.5, pp. 321–367. Springer.Google Scholar
  29. 29.
    Hansen, P., B. Jaumard, G.-B.D. Nguetsé, and M.P. de Aragão. 1995. Models and algorithms for probabilistic and bayesian logic. In IJCAI, pp. 1862–1868.Google Scholar
  30. 30.
    Horn, A., and A. Tarski. 1948. Measures in boolean algebras. Transactions of the American Mathematical Society 64 (3): 467–497.CrossRefGoogle Scholar
  31. 31.
    Jaumard, B., P. Hansen, and M.P. de Aragão. 1991. Column generation methods for probabilistic logic. INFORMS Journal on Computing 3 (2): 135–148.CrossRefGoogle Scholar
  32. 32.
    Kavvadias, D., and C.H. Papadimitriou. 1990. A linear programming approach to reasoning about probabilities. Annals of Mathematics and Artificial Intelligence 1: 189–205.CrossRefGoogle Scholar
  33. 33.
    Lindström, P. 1966. First order predicate logic with generalized quantifiers. Theoria 32 (3): 186–195.Google Scholar
  34. 34.
    Martin, B., F.R. Madelaine, and J. Stacho. 2015. Constraint satisfaction with counting quantifiers. SIAM Journal on Discrete Mathematics 29 (2): 1065–1113.CrossRefGoogle Scholar
  35. 35.
    Mostowski, A. 1957. On a generalization of quantifiers. Fundamenta Mathematicae 44 (2): 12–36.CrossRefGoogle Scholar
  36. 36.
    Mundici, D. 2006. Bookmaking over infinite-valued events. International Journal of Approximate Reasoning 43 (3): 223–240.CrossRefGoogle Scholar
  37. 37.
    Mundici, D. 2011. Advanced Łukasiewicz calculus and MV-algebras, Trends in Logic. Netherlands: Springer.CrossRefGoogle Scholar
  38. 38.
    Nilsson, N. 1986. Probabilistic logic. Artificial Intelligence 28 (1): 71–87.CrossRefGoogle Scholar
  39. 39.
    Papadimitriou, C., and K. Steiglitz. 1998. Combinatorial Optimization: Algorithms and Complexity. Dover.Google Scholar
  40. 40.
    Pratt-Hartmann, I. 2005. Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information 14 (3): 369–395.CrossRefGoogle Scholar
  41. 41.
    Pratt-Hartmann, I. 2008. On the computational complexity of the numerically definite syllogistic and related logics. The Bulletin of Symbolic Logic 14 (1): 1–28.CrossRefGoogle Scholar
  42. 42.
    Schrijver, A. 1986. Theory of Linear and Integer Programming. New York: Wiley.Google Scholar
  43. 43.
    Walley, P., R. Pelessoni, and P. Vicig. 2004. Direct algorithms for checking consistency and making inferences from conditional probability assessments. Journal of Statistical Planning and Inference 126 (1): 119–151.CrossRefGoogle Scholar
  44. 44.
    Warners, J.P. 1998. A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters 68 (2): 63–69.CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of São PauloSao PauloBrazil

Personalised recommendations