Advertisement

Abstract

Logic Programs with Annotated Disjunctions and CP-logic are two different but related languages for expressing probabilistic information in logic programming. The paper presents a top down interpreter for computing the probability of a query from a program in one of these two languages. The algorithm is based on the one available for ProbLog. The performances of the algorithm are compared with those of a Bayesian reasoner and with those of the ProbLog interpreter. On programs that have a small grounding, the Bayesian reasoner is more scalable, but programs with a large grounding require the top down interpreter. The comparison with ProbLog shows that the added expressiveness effectively requires more computation resources.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. J. Log. Program 19/20, 9–71 (1994)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers 35(8), 677–691 (1986)zbMATHCrossRefGoogle Scholar
  3. 3.
    Clark, K.L.: Negation as failure. In: Logic and Databases, Plenum Press, New York (1978)Google Scholar
  4. 4.
    De Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2462–2467 (2007)Google Scholar
  5. 5.
    Lauritzen, S., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, B 50(2), 157–224 (1988)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Miller, D.M., Drechsler, R.: On the construction of multiple-valued decision diagrams. In: Proceedings 32nd IEEE International Symposium on Multiple-Valued Logic, pp. 245–253. IEEE Computer Society Press, Los Alamitos (2002)CrossRefGoogle Scholar
  7. 7.
    Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)zbMATHCrossRefGoogle Scholar
  8. 8.
    Vennekens, J., Denecker, M., Bruynooghe, M.: Representing causal information about a probabilistic process. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Fabrizio Riguzzi
    • 1
  1. 1.Dip. di Ingegneria – Università di Ferrara – Via Saragat, 1 – 44100 FerraraItaly

Personalised recommendations