Probabilistic Logic for Intelligent Systems

  • Thomas C. HendersonEmail author
  • Robert Simmons
  • Bernard Serbinowski
  • Xiuyi Fan
  • Amar Mitiche
  • Michael Cline
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 867)


Given a knowledge base in Conjunctive Normal Form for use by an intelligent agent, with probabilities assigned to the conjuncts, the probability of any new query sentence can be determined by solving the Probabilistic Satisfiability Problem (PSAT). This involves finding a consistent probability distribution over the atoms (if they are independent) or complete conjunction set of the atoms. We show how this problem can be expressed and solved as a set of nonlinear equations derived from the knowledge base sentences and standard probability of logical sentences. Evidence is given that numerical gradient descent algorithms can be used more effectively then other current methods to find PSAT solutions.


PSAT Probabilistic knowledge base Nonlinear systems 


  1. Adams, E.W.: A Primer of Probability Logic. CLSI Publications, Stanford (1998)zbMATHGoogle Scholar
  2. Biba, M.: Integrating logic and probability: algortihmic improvements in markov logic networks. Ph.D. thesis, University of Bari, Bari, Italy (2009)Google Scholar
  3. Boole, G.: An Investigation of the Laws of Thought. Walton and Maberly, London (1854)zbMATHGoogle Scholar
  4. Domingos, P., Dowd, D.: Markov Logic: An Interface Layer for Artificial Intelligence. Morgan and Claypool, San Rafael (2009)Google Scholar
  5. Georgakopoulos, G., Kavvadiass, D., Papadimitriou, C.H.: Probabilistic satisfiability. J. Complex. 4, 1–11 (1988)MathSciNetCrossRefGoogle Scholar
  6. Gogate, V., Domingo, P.: Probabilistic theorem proving. Commun. ACM 59(7), 107–115 (2016)CrossRefGoogle Scholar
  7. Hailperin, T.: Sentential Probability Logic. Lehigh University Press, Cranbury (1996)zbMATHGoogle Scholar
  8. Henderson, T.C., Mitiche, A., Simmons, R., Fan, X.: A preliminary study of probabilistic argumentation. Technical report UUCS-17-001, University of Utah, Salt Lake City, UT, February 2017aGoogle Scholar
  9. Henderson, T.C., Simmons, R., Mitiche, A., Fan, X., Sacharny, D.: A probabilistic logic for multi-source heterogeneous information fusion. In: Proceedings of the IEEE Conference on Multisensor Fusion and Integration for Intelligent Systems, Daegu, South Korea, November 2017bGoogle Scholar
  10. Hunter, A.: A probabilistic approach to modeling uncertain logical arguments. Int. J. Approximate Reasoning 54, 47–81 (2013)CrossRefGoogle Scholar
  11. Kowalski, R., Hayes, P.J.: Semantic trees in automatic theorem proving. In: Automation of Reasoning, Berlin, pp. 217–232 (1983)CrossRefGoogle Scholar
  12. Nilsson, L.: Probabilistic Logic. Artif. Intell. J. 28, 71–87 (1986)MathSciNetCrossRefGoogle Scholar
  13. Sacharny, D., Henderson, T.C., Simmons, R., Mitiche, A., Welker, T., Fan, X.: A novel multi-source fusion framework for dynamic geospatial data analysis. In: Proceedings of the IEEE Conference on Multisensor Musion and Integration, Daegu, South Korea, November 2017Google Scholar
  14. Thimm, M.: Measuring inconsistency in probablilistic knowledge bases. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, Montreal, Canada, pp. 530–537, June 2009Google Scholar
  15. Thimm, M.: A probabilistic semantics for abstract argumentation. In: Proceedings of the 20th European Conference on Artificial Intelligence, Monpelier, France, August 2012Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Thomas C. Henderson
    • 1
  • Robert Simmons
    • 1
  • Bernard Serbinowski
    • 1
  • Xiuyi Fan
    • 2
  • Amar Mitiche
    • 3
  • Michael Cline
    • 4
  1. 1.University of UtahSalt Lake CityUSA
  2. 2.University of SwanseaSwanseaWales
  3. 3.University of MontrealMontrealCanada
  4. 4.Simon Fraser UnviersityBurnabyCanada

Personalised recommendations