Special issue on probabilistic logic programming (PLP 2018). (English) Zbl 1475.00086

From the text: This special issue followed the 5th workshop on probabilistic logic programming, held in Ferrara, Italy (September 1, 2018) jointly with the international conference on inductive logic programming (September 2–4 2018).


00B25 Proceedings of conferences of miscellaneous specific interest
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68N17 Logic programming


Full Text: DOI


[1] Belle, Vaishak; de Raedt, Luc, Semiring programming: a semantic framework for generalized sum product problems, Int. J. Approx. Reason., 126, 181-201 (November 2020) · Zbl 1490.68176
[2] Kaur, Navdeep; Kunapuli, Gautam; Natarajan, Sriraam, Non-parametric learning of lifted restricted Boltzmann machines, Int. J. Approx. Reason., 120, 33-47 (May 2020) · Zbl 1433.68355
[3] Tiger, Mattias; Heintz, Fredrik, Incremental reasoning in probabilistic signal temporal logic, Int. J. Approx. Reason., 119, 325-352 (April 2020) · Zbl 1434.68562
[4] Cattelani, Luca; Chesani, Federico; Palmerini, Luca; Palumbo, Pierpaolo; Chiari, Lorenzo; Bandinelli, Stefania, A rule-based framework for risk assessment in the health domain, Int. J. Approx. Reason., 119, 242-259 (April 2020)
[5] Finzi, Alberto; Lukasiewicz, Thomas, Partially observable game-theoretic agent programming in golog, Int. J. Approx. Reason., 119, 220-241 (April 2020) · Zbl 1434.68583
[6] Mantadelis, Theofrastos; Bistarelli, Stefano, Probabilistic abstract argumentation frameworks, a possible world view, Int. J. Approx. Reason., 119, 204-219 (April 2020) · Zbl 1434.68558
[7] Treszkaia, Laszlo; Belle, Vaishak, A correctness result for synthesizing plans with loops in stochastic domains, Int. J. Approx. Reason., 119, 92-107 (April 2020) · Zbl 1434.68549
[8] Deratani Mauá, Denis; Gagliardi Cozman, Fabio, Complexity results for probabilistic answer set programming, Int. J. Approx. Reason., 118, 133-154 (March 2020) · Zbl 1468.68215
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.