Abstract
This paper focuses on the investigation and improvement of knowledge representation language P-log that allows for both logical and probabilistic reasoning. We refine the definition of the language by eliminating some ambiguities and incidental decisions made in its original version and slightly modify the formal semantics to better match the intuitive meaning of the language constructs. We also define a new class of coherent (i.e., logically and probabilistically consistent) P-log programs which facilitates their construction and proofs of correctness. There are a query answering algorithm, sound for programs from this class, and a prototype implementation which, due to their size, are not included in the paper. They, however, can be found in the dissertation of the first author.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Balai, E.: Investigating and Extending P-log. Ph.D. thesis, Texas Tech University (2017)
Balai, E., Gelfond, M.: On the relationship between P-log and LPMLN. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pp. 915–921. http://www.ijcai.org/Abstract/16/134 (2016)
Balai, E., Gelfond, M.: Refining and generalizing P-log - preliminary report. In: Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning, ASPOCP@LPNMR 2017, Espoo, Finland, July 3, 2017. http://ceur-ws.org/Vol-1868/p6.pdf (2017)
Balai, E., Gelfond, M., Zhang, Y.: Towards answer set programming with sorts. In: Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings, pp. 135–147 (2013)
Balduccini, M.: Answer set solving and non-herbrand functions. In: Proceedings of the 14th International Workshop on Non-Monotonic Reasoning (NMR’2012)(Jun 2012) (2012)
Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, pp. 9–18 (2003)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic Reasoning with Answer Sets. in: International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 21–33. Springer (2004)
Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Logic Program. 9(01), 57–144 (2009)
Baral, C., Hunsaker, M.: Using the probabilistic logic programming language P-log for causal and counterfactual reasoning and non-naive conditioning. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 243–249 (2007)
Bartholomew, M., Lee, J.: Stable models of multi-valued formulas: partial versus total functions. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014. http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8020 (2014)
Cabalar, P.: Partial functions and equality in answer set programming. In: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings, pp. 392–406. https://doi.org/10.1007/978-3-540-89982-2_36 (2008)
Cozman, F.G., Mauá, D.D.: On the semantics and complexity of probabilistic logic programs. J. Artif. Intell. Res. 60, 221–262 (2017)
De Raedt, L., Kimmig, A.: Probabilistic (logic) programming concepts. Mach. Learn. 100(1), 5–47 (2015)
Dix, J., Gottlob, G., Marek, V. W.: Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundam. Inform. 28(1-2), 87–100 (1996). https://doi.org/10.3233/FI-1996-281205
Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D., Gutmann, B., Thon, I., Janssens, G., De Raedt, L.: Inference and learning in probabilistic logic programs using weighted boolean formulas. Theory Pract. Logic Program. 15(3), 358–401 (2015)
Gelfond, M., Kahl, Y.: Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-set Programming Approach. Cambridge University Press, Cambridge (2014)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988, vol. 2, pp. 1070–1080 (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. N. Gener. Comput. 9(3/4), 365–386 (1991)
Gelfond, M., Rushton, N.: Causal and Probabilistic Reasoning in P-log. In: Dechter, R., Geffner, H., Halpern, J. (eds.) A Tribute to Judea Pearl, pp. 337-359, College Publications (2010)
Gelfond, M., Zhang, Y.: Vicious circle principle and logic programs with aggregates. TPLP 14(4-5), 587–601 (2014). https://doi.org/10.1017/S1471068414000222
Gelfond, M., Zhang, Y.: Vicious circle principle and formation of sets in ASP based languages. In: Logic Programming and Nonmonotonic Reasoning, 14Th International Conference, LPNMR (2017)
Halpern, J.Y.: A modification of the Halpern-Pearl definition of causality. In: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI’15, pp. 3022–3033. AAAI Press. http://dl.acm.org/citation.cfm?id=2832581.2832671 (2015)
Halpern, J. Y., Pearl, J.: Causes and explanations: a structural-model approach. Part I: Causes. Br. J. Philos. Sci. 56(4), 843–887 (2005)
Jaynes, E. T.: Probability Theory: The Logic of Science. Cambridge University Press, Cambridge (2003)
Kersting, K., Raedt, L.D.: Bayesian logic programs. In: Inductive Logic Programming, 10th International Conference, ILP 2000, Work-in-progress reports, London, UK, July 2000, Proceedings. http://ceur-ws.org/Vol-35/07-KerstingDeRaedt.ps (2000)
Lee, J., Wang, Y.: Weighted rules under the stable model semantics. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016, pp. 145–154. http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12901 (2016)
Lee, J., Yang, Z.: LPMLN, weak constraints, and p-log. in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, pp. 1170–1177, San Francisco, California, USA (2017)
Lifschitz, V., Turner, H.: Splitting a logic program. In; Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Marherita Ligure, Italy, June 13-18, 1994, pp. 23–37 (1994)
Lukasiewicz, T.: Probabilistic Logic Programming. In: ECAI, pp. 388–392 (1998)
Lukasiewicz, T.: Probabilistic description logic programs. Int. J. Approx. Reason. 45(2), 288–307 (2007)
De Morais, E.M., Finger, M.: Probabilistic Answer Set Programming. In: Brazilian Conference on Intelligent Systems, BRACIS 2013, Fortaleza, CE, Brazil, 19-24 October, 2013, pp. 150–156. https://doi.org/10.1109/BRACIS.2013.33 (2013)
Muggleton, S., et al.: Stochastic logic programs. Advances in Inductive Logic Programming 32, 254–264 (1996)
Ng, R., Subrahmanian, V. S.: Probabilistic logic programming. Inf. Comput. 101(2), 150–201 (1992)
Ngo, L., Haddawy, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theor. Comput. Sci. 171(1-2), 147–177 (1997)
Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: ECAI, vol. 6, pp. 412–416 (2006)
Pearl, J.: Reasoning with cause and effect. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. vol. 2, 1450 pages, pp 1437–1449 (1999)
Pearl, J.: Causality: Models, Reasoning, and Inference. Cambridge University Press, Cambridge (2000)
Pereira, L. M., Saptawijaya, A.: Programming Machine Ethics, 1st edn. Springer Publishing Company, Incorporated, Berlin (2016)
Poole, D.: Probabilistic horn abduction and bayesian networks. Artif. Intell. 64, 81–129 (1993)
Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94(1-2), 7–56 (1997)
Raedt, L.D., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, pp. 2462–2467 . http://ijcai.org/Proceedings/07/Papers/396.pdf (2007)
Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Inproceedings of the 12th International Conference on Logic Programming (ICLP’95), pp. 715–729. MIT Press (1995)
Sato, T., Kameya, Y.: PRISM: A language for symbolic-statistical modeling. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, Nagoya, Japan, August 23-29, 1997, vol. 2, pp. 1330–1339. http://ijcai.org/Proceedings/97-2/Papers/078.pdf (1997)
Vennekens, J., Denecker, M., Bruynooghe, M.: CP-logic: a language of causal probabilistic events and its relation to logic programming. Theory Pract. Logic Program. 9(3), 245–308 (2009)
Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings, pp. 431–445. https://doi.org/10.1007/978-3-540-27775-0_30 (2004)
Wellman, M. P., Henrion, M.: Explaining ’explaining away’. IEEE Trans. Pattern Anal. Mach. Intell. 15(3), 287–292 (1993)
Zhang, S., Stone, P.: Corpp: Commonsense reasoning and probabilistic planning, as applied to dialog with a mobile robot. In: Proceedings of the 29th Conference on Artificial Intelligence (AAAI) (2015)
Zhu, W.: Plog: Its Algorithms and Applications. Ph.D. thesis, Texas Tech University (2012)
Acknowledgements
We would like to thank Leroy Mason and Nelson Rushton for useful discussions on subjects related to this paper. We also grateful to the anonymous reviewers for their comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
In this Appendix we formally define the probabilistic measure defined by a P-log program satisfying Conditions 1-3 from Section 3 . The definition is very similar to the one from [8], with a small difference related to the addition of rules names to special terms random, truly_random, do and probability atoms and the corresponding changes in axioms, introduced in this paper.
Let π be a P-log program with signature Σ, W be an interpretation of Σ, a be an attribute term of Σ. Consider random selection rule of the form
such that W satisfies B. Let PO(W,rn,a) be the set of constants defined as follows:
We will refer to elements of the set PO(W,rn,a) as possible outcomes of a in W via rule rn, and to every atom a = y s.t. y ∈ PO(W,rn,a) as a possible atom in W via rn. Note that, by Condition 1, there can be at most one rule such that a = y is possible in W vie that rule, so we will sometimes say that a = y is possible in W if there is a rule rn′ such that a = y is possible in W via rn′.
Let π be a P-log program and a be a random attribute term of the signature of π. For every possible world W of π and every possible atom a = y in W via some rule random(r,a,p) ← B, such that W⊧truly_random(r,a), we will define the corresponding causal probability P(W,a = y). Whenever possible, the probability of an atom a = y will be directly assigned by pr-atoms of the program and denoted by PA(W,a = y). To define probabilities of the remaining atoms we assume that by default, all values of a given attribute which are not assigned a probability by pr-atoms are equally likely. Their probabilities will be denoted by PD(W,a = y). (PA stands for assigned probability and PD stands for default probability).
More precisely, for each atom a = y possible in W via some rule r or π:
-
1.
Assigned probability:
If π contains pr(r,a = y | B′) = v, W⊧B′, then
$$PA(W, a = y) = v $$(note that Condition 2 implies that the probability is uniquely defined).
-
2.
Default probability:
Let
$$A_{a}(W) =\{ y ~|~ a = y \text{ is possible in } W \text{ and } PA(W, a= y)\ \text{is defined}\}, $$$$D_{a}(W) = \{ y ~|~ a = y \text{ is possible in } W\} \setminus A_{a}(W) $$and \(\alpha _{a}(W) = {\sum }_{y \in A_{a}(W)} PA(W, a = y)\).
The default probability of a = y in W is defined as follows:
$$PD(W, a = y) = \frac{1 - \alpha_{a}(W)} {|D_{a}(W)|} $$ -
3.
Finally, the causal probability P(W,a = y) of a = y in W is defined by:
$$P(W, a = y) = \left\{\begin{array}{ll} PA(W, a = y) & \text{ if } y \in A_{a}(W)\\ PD(W, a = y) & \text{ otherwise}. \end{array} \right. $$
Definition 1 (Measure)
-
1.
Let W be an interpretation of π. The unnormalized probability, \(\hat {\mu }_{\Pi }(W)\), of W induced by π is
$$\hat{\mu}_{\Pi}(W) = {\prod}_{W(a) = y} P(W, a = y ) $$where the product is taken over atoms for which P(W,a = y) is defined.
-
2.
Suppose π is a P-log program having at least one possible world with nonzero unnormalized probability. The measure, μπ(W), of a possible world Winduced by π is the unnormalized probability of W divided by the sum of the unnormalized probabilities of all possible worlds of π, i.e.,
$$\mu_{\Pi}(W) = \frac{\hat{\mu}_{\Pi}(W)} {{\sum}_{W_{i} \in {\Omega}({\Pi})}\hat{\mu}_{\Pi}(W_{i})} $$
When the program π is clear from the context we may simply write \(\hat {\mu }\) and μ instead of \(\hat {\mu }_{\Pi }\) and μπ respectively.
Definition 2 (Probability)
Suppose π is a P-log program having at least one possible world with nonzero unnormalized probability. The probability, Pπ(E), of a set E of possible worlds of program π is the sum of the measures of the possible worlds from E, i.e.
When π is clear from the context we may simply write P instead of Pπ.
Definition 3 (Probability of a literal)
The probability with respect to program π of a literal l of π, Pπ(l), is the sum of the measures of the possible worlds of π in which l is true, i.e.
Note that, given that conditions 1-3 are satisfied, the function Pπ is defined iff
Rights and permissions
About this article
Cite this article
Balai, E., Gelfond, M. & Zhang, Y. P-log: refinement and a new coherency condition. Ann Math Artif Intell 86, 149–192 (2019). https://doi.org/10.1007/s10472-019-09620-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-019-09620-2