Skip to main content

A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 2016)

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

Included in the following conference series:

Abstract

This System Description paper describes the software framework PrASP (“Probabilistic Answer Set Programming”). PrASP is both an uncertainty reasoning and machine learning software and a probabilistic logic programming language based on Answer Set Programming (ASP). Besides serving as a research software platform for non-monotonic (inductive) probabilistic logic programming, our framework mainly targets applications in the area of uncertainty stream reasoning. PrASP programs can consist of ASP (AnsProlog) as well as First-Order Logic formulas (with stable model semantics), annotated with conditional or unconditional probabilities or probability intervals. A number of alternative inference algorithms allow to attune the system to different task characteristics (e.g., whether or not independence assumptions can be made).

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    http://ubuntu1.it.nuigalway.ie:8977/PrASP_WebInterface/static/ABOUT.html

  2. 2.

    PrASP’s default ASP grounder/solver Clingo also allows for function symbols, but for simplicity we ignore functions in the rest of this section.

  3. 3.

    https://en.wikipedia.org/wiki/Monty_Hall_problem

  4. 4.

    Not related to the Iterative Refinement method in linear systems solving.

References

  1. Lee, J., Palla, R.: System f2lp – computing answer sets of first-order formulas. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 515–521. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04238-6_51

    Chapter  Google Scholar 

  2. Sato, T., Kameya, Y.: Prism: a language for symbolic-statistical modeling. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, IJCAI 1997, pp. 1330–1335 (1997)

    Google Scholar 

  3. Muggleton, S.: Learning stochastic logic programs. In: Electronic Transactions in Artificial Intelligence (2000)

    Google Scholar 

  4. Cussens, J.: Parameter estimation in stochastic logic programs. Mach. Learn. 44, 245–271 (2000)

    Article  MATH  Google Scholar 

  5. Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: IJCAI, pp. 1300–1309. Springer (1999)

    Google Scholar 

  6. Lee, J., Meng, Y., Wang, Y.: Markov logic style weighted rules under the stable model semantics. In: ICLP 2015 (Technical Communications), vol. 1433, (2015)

    Google Scholar 

  7. Kersting, K., Raedt, L.D.: Bayesian logic programs. In: Proceedings of the 10th International Conference on Inductive Logic Programming (2000)

    Google Scholar 

  8. Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its application in link discovery. In: IJCAI, pp. 2462–2467 (2007)

    Google Scholar 

  9. Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94, 7–56 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62, 107–136 (2006)

    Article  Google Scholar 

  11. Ng, R.T., Subrahmanian, V.S.: Stable semantics for probabilistic deductive databases. Inf. Comput. 110, 42–83 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Log. Program. 9, 57–144 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Saad, E., Pontelli, E.: Hybrid probabilistic logic programs with non-monotonic negation. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 204–220. Springer, Heidelberg (2005). doi:10.1007/11562931_17

    Chapter  Google Scholar 

  14. Corapi, D., Sykes, D., Inoue, K., Russo, A.: Probabilistic rule learning in nonmonotonic domains. In: Leite, J., Torroni, P., Ågotnes, T., Boella, G., Torre, L. (eds.) CLIMA 2011. LNCS (LNAI), vol. 6814, pp. 243–258. Springer, Heidelberg (2011). doi:10.1007/978-3-642-22359-4_17

    Chapter  Google Scholar 

  15. Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431–445. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27775-0_30

    Chapter  Google Scholar 

  16. Sato, T.: A statistical learning method for logic programs with distribution semantics. In: International Conference on Logic Programming, pp. 715–729 (1995)

    Google Scholar 

  17. Nickles, M., Mileo, A.: Probabilistic inductive logic programming based on answer set programming. In: 15th International Workshop on Non-Monotonic Reasoning (NMR 2014) (2014)

    Google Scholar 

  18. Nilsson, N.J.: Probabilistic logic. Artif. Intell. 28(1), 71–87 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  19. de Bona, G., Cozman, F.G., Finger, M.: Towards classifying propositional probabilistic logics. J. Appl. Logic 12(3), 349–368 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  20. Riguzzi, F., Swift, T.: Probabilistic logic programming under the distribution semantics. In: Kifer, M., Liu, Y.A. (eds.) Declarative Logic Programming: Theory, Systems, and Applications, LNCS. Springer (2016)

    Google Scholar 

  21. Nickles, M., Mileo, A.: A hybrid approach to inference in probabilistic non-monotonic logic programming. In: 2015 Probabilistic Logic Programming (PLP 2015), CEUR (2015)

    Google Scholar 

  22. Rödder, W., Meyer, C.: Coherent knowledge processing at maximum entropy by SPIRIT. In: Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI 1996) (1996)

    Google Scholar 

  23. Nickles, M., Mileo, A.: Web stream reasoning using probabilistic answer set programming. In: Proceedings of Web Reasoning and Rule Systems - 8th International Conference (RR 2014) (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthias Nickles .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Nickles, M. (2016). A Tool for Probabilistic Reasoning Based on Logic Programming and First-Order Theories Under Stable Model Semantics. In: Michael, L., Kakas, A. (eds) Logics in Artificial Intelligence. JELIA 2016. Lecture Notes in Computer Science(), vol 10021. Springer, Cham. https://doi.org/10.1007/978-3-319-48758-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48758-8_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48757-1

  • Online ISBN: 978-3-319-48758-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics