Abstract
In conditional probabilistic logic programming, given a query, the two most common forms for answering the query are either a probability interval or a precise probability obtained by using the maximum entropy principle. The former can be noninformative (e.g., interval [0, 1]) and the reliability of the latter is questionable when the priori knowledge is imprecise. To address this problem, in this paper, we propose some methods to quantitatively measure if a probability interval or a single probability is sufficient for answering a query. We first propose an approach to measuring the ignorance of a probabilistic logic program with respect to a query. The measure of ignorance (w.r.t. a query) reflects how reliable a precise probability for the query can be and a high value of ignorance suggests that a single probability is not suitable for the query. We then propose a method to measure the probability that the exact probability of a query falls in a given interval, e.g., a second order probability. We call it the degree of satisfaction. If the degree of satisfaction is high enough w.r.t. the query, then the given interval can be accepted as the answer to the query. We also prove our measures satisfy many properties and we use a case study to demonstrate the significance of the measures.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Baral, C., Gelfond, M., Rushton, J.N.: Probabilistic reasoning with answer sets. In: LPNMR, pp. 21–33 (2004)
Baral, C., Hunsaker, M.: Using the probabilistic logic programming language p-log for causal and counterfactual reasoning and non-naive conditioning. In: IJCAI, pp. 243–249 (2007)
Broecheler, M., Simari, G.I., Subrahmanian, V.S.: Using histograms to better answer queries to probabilistic logic programs. In: Proceedings of the 25th International Conference on Logic Programming, pp. 40–54. Springer, Berlin, Heidelberg (2009)
Costa, V.S., Page, D., Qazi, M., Cussens, J.: CLP(\({\mathcal{BN}}\)): constraint logic programming for probabilistic knowledge. In: UAI, pp. 517–524 (2003)
Dekhtyar, A., Dekhtyar, M.I.: Possible worlds semantics for probabilistic logic programs. In: ICLP, pp. 137–148 (2004)
Dubois, D., Godo, L., de Mántaras, R.L., Prade, H.: Qualitative reasoning with imprecise probabilities. J. Intell. Inf. Syst. 2(4), 319–363 (1993)
Frisch, A.M., Haddawy, P.: Anytime deduction for probabilistic logic. Artif. Intell. 69(1–2), 93–122 (1994)
Fuhr, N.: Probabilistic datalog: Implementing logical information retrieval for advanced applications. JASIS 51(2), 95–110 (2000)
Kern-Isberner, G., Lukasiewicz, T.: Combining probabilistic logic programming with the power of maximum entropy. Artif. Intell. 157(1–2), 139–202 (2004)
Kern-Isberner, G., Rödder, W.: Belief revision and information fusion on optimum entropy. Int. J. Intell. Syst. 19(9), 837–857 (2004)
Kraus, S., Lehmann, D.J., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1–2), 167–207 (1990)
Lukasiewicz, T.: Probabilistic logic programming. In: ECAI, pp. 388–392 (1998)
Lukasiewicz, T.: Probabilistic logic programming under inheritance with overriding. In UAI, pp. 329–336 (2001)
Lukasiewicz, T.: Probabilistic logic programming with conditional constraints. ACM Trans. Comput. Log. 2(3), 289–339 (2001)
Lukasiewicz, T.: Weak nonmonotonic probabilistic logics. Artif. Intell. 168(1–2), 119–161 (2005)
Lukasiewicz, T.: Nonmonotonic probabilistic logics under variable-strength inheritance with overriding: complexity, algorithms, and implementation. Int. J. Approx. Reasoning 44(3), 301–321 (2007)
Ng, R., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. J. Automat. Reason. 10, 565–580 (1991)
Ng, R., Subrahmanian, V.S.: Probabilistic logic programming. Inf. Comput. 101(2), 150–201 (1992)
Rödder, W., Kern-Isberner, G.: From information to probability: an axiomatic approach—inference isinformation processing. Int. J. Intell. Syst. 18(4), 383–403 (2003)
De Raedt, L., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its application in link discovery. In: IJCAI, pp. 2462–2467 (2007)
Rödder, W.: On the measurability of knowledge acquisition, query processing. Int. J. Approx. Reasoning 33(2), 203–218 (2003)
Saad, E.: Qualitative and quantitative reasoning in hybrid probabilistic logic programs. In: ISIPTA’07—Fifth International Symposium On Imprecise Probability: Theories And Applications (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Yue, A., Liu, W. & Hunter, A. Imprecise probabilistic query answering using measures of ignorance and degree of satisfaction. Ann Math Artif Intell 64, 145–183 (2012). https://doi.org/10.1007/s10472-012-9286-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-012-9286-x