Baral, C., Gelfond, M. and Rushton, J. N. 2009. Probabilistic reasoning with answer sets. Theor. Pract. Log. Prog. 9 (1), 57–144.
Bauters, L., Schockaert, S., De Cock, M. and Vermeir, D. 2010. Possibilistic answer set programming revisited. In Conference on Uncertainty in Artificial Intelligence. AUAI Press.
Bistarelli, S., Montanari, U., Rossi, F. and Santini, F. 2007. Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming. Electr. Notes Theor. Comput. Sci. 190 (3), 111–127.
Bistarelli, S. and Rossi, F. 2001. Semiring-based contstraint logic programming: syntax and semantics. ACM Trans. Program. Lang. Syst. 23 (1), 1–29.
Christiansen, H. and Gallagher, J. P. 2009. Non-discriminating arguments and their uses. In International Conference on Logic Programming. LNCS, vol. 5649. Springer, 55–69.
Dantsin, E. 1991. Probabilistic logic programs and their semantics. In Russian Conference on Logic Programming. LNCS, vol. 592. Springer, 152–164.
De Raedt, L., Demoen, B., Fierens, D., Gutmann, B., Janssens, G., Kimmig, A., Landwehr, N., Mantadelis, T., Meert, W., Rocha, R., Santos Costa, V., Thon, I. and Vennekens, J. 2008. Towards digesting the alphabet-soup of statistical relational learning. In NIPS2008 Workshop on Probabilistic Programming, 13 December 2008, Whistler, Canada.
De Raedt, L., Kimmig, A. and Toivonen, H. 2007. ProbLog: A probabilistic Prolog and its application in link discovery. In Internation Joint Conference on Artificial Intelligence, IJCAI, 2462–2467.
Dubois, D., Lang, J. and Prade, H. 1991. Towards possibilistic logic programming. In International Conference on Logic Programming. MIT Press, 581–595.
Dubois, D., Lang, J. and Prade, H. 1994. Possibilistic logic. In Handbook of logic in artificial intelligence and logic programming, vol. 3, Gabbay, D. M., Hogger, C. J. and Robinson, J. A., Eds. Oxford University, 439–514.
Dubois, D. and Prade, H. 2004. Possibilistic logic: a retrospective and prospective view. Fuzzy Sets System 144 (1), 3–23.
Kersting, K. and De Raedt, L. 2000. Bayesian logic programs. In Inductive Logic Programming, CEUR Workshop Proceedings. Sun SITE Central Europe.
Kimmig, A., Costa, V. S., Rocha, R., Demoen, B. and Raedt, L. D. 2008. On the efficient execution of problog programs. In International Conference on Logic Programming. LNCS, vol. 5366. Springer, 175–189.
Meert, W., Struyf, J. and Blockeel, H. 2009. CP-Logic theory inference with contextual variable elimination and comparison to BDD based inference methods. In International Conference on Inductive Logic Programming. LNCS, vol. 5989. Springer, 96–109.
Nicolas, P., Garcia, L., Stéphan, I. and Lefèvre, C. 2006. Possibilistic uncertainty handling for answer set programming. Ann. Math. Artif. Intell. 47 (1–2), 139–181.
Nieves, J. C., Osorio, M. and Cortés, U. 2007. Semantics for possibilistic disjunctive programs. In International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS, vol. 4483. Springer, 315–320.
Osorio, M. and Nieves, J. C. 2009. Possibilistic well-founded semantics. In Mexican International Conference on Artificial Intelligence. LNCS, vol. 5845. Springer, 15–26.
Poole, D. 1993. Logic programming, abduction and probability — a top-down anytime algorithm for estimating prior and posterior probabilities. New Gener. Comput. 11 (3), 377–400.
Poole, D. 1997. The Independent Choice Logic for modelling multiple agents under uncertainty. Artif. Intell. 94 (1–2), 7–56.
Poole, D. 2000. Abducing through negation as failure: stable models within the independent choice logic. J. Log. Program. 44 (1–3), 5–35.
Riguzzi, F. 2007. A top down interpreter for LPAD and CP-logic. In Congress of the Italian Association for Artificial Intelligence. LNAI, vol. 4733. Springer, 109–120.
Riguzzi, F. 2008. Inference with logic programs with annotated disjunctions under the well founded semantics. In International Conference on Logic Programming. LNCS, vol. 5366. Springer, 667–771.
Riguzzi, F. 2009. Extended semantics and inference for the Independent Choice Logic. Logic J. IGPL 17 (6), 589–629.
Riguzzi, F. 2010. SLGAD resolution for inference on Logic Programs with Annotated Disjunctions. Fundam. Inform. 102 (3–4), 429–466.
Riguzzi, F. and Swift, T. 2010a. An extended semantics for logic programs with annotated disjunctions and its efficient implementation. In Italian Conference on Computational Logic. CEUR Workshop Proceedings, vol. 598. Sun SITE Central Europe.
Riguzzi, F. and Swift, T. 2010b. Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions. In Technical Communications of the International Conference on Logic Programming. LIPIcs, vol. 7. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 162–171.
Santos Costa, V., Page, D., Qazi, M. and Cussens, J. 2003. CLP(): Constraint logic programming for probabilistic knowledge. In Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann.
Sato, T. 1995. A statistical learning method for logic programs with distribution semantics. In International Conference on Logic Programming. MIT Press, 715–729.
Swift, T. 1999. Tabling for non-monotonic programming. Ann. Math. Artif. Intell. 25 (3–4), 201–240.
Vennekens, J. and Verbaeten, S. 2003. Logic programs with annotated disjunctions. Tech. Rep. CW386, K. U. Leuven.
Vennekens, J., Verbaeten, S. and Bruynooghe, M. 2004. Logic programs with annotated disjunctions. In International Conference on Logic Programming. LNCS, vol. 3131. Springer, 195–209.
Zhou, N.-F. 2011. The language features and architecture of B-Prolog. CoRR abs/1103.0812.