Abstract
Reasoning with qualitative and quantitative uncertainty is required in some real-world applications [6]. However, current extensions to logic programming with uncertainty support representing and reasoning with either qualitative or quantitative uncertainty. In this paper we extend the language of Hybrid Probabilistic Logic programs [29,27], originally introduced for reasoning with quantitative uncertainty, to support both qualitative and quantitative uncertainty. We propose to combine disjunctive logic programs [10,19] with Extended and Normal Hybrid Probabilistic Logic Programs (EHPP [27] and NHPP [29]) in a unified logic programming framework, to allow directly and intuitively to represent and reason in the presence of both qualitative and quantitative uncertainty. The semantics of the proposed languages are based on the answer sets semantics and stable model semantics of extended and normal disjunctive logic programs [10,19]. In addition, they also rely on the probabilistic answer sets semantics and the stable probabilistic model semantics of EHPP [27] and NHPP [29].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baral, C., et al.: Probabilistic reasoning with answer sets. In: LPNMR (2004)
Brewka, G., Dix, J.: Knowledge representation with logic programs. In: Dix, J., Moniz Pereira, L., Przymusinski, T.C. (eds.) LPKR 1997. LNCS (LNAI), vol. 1471. Springer, Heidelberg (1998)
Dekhtyar, A., Dekhtyar, I.: Possible worlds semantics for probabilistic logic programs. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004, vol. 3132, pp. 137–148. Springer, Heidelberg (2004)
Dekhtyar, A., Subrahmanian, V.S.: Hybrid probabilistic program. Journal of LP 43(3), 187–250 (2000)
Dekhtyar, M., Dekhtyar, A., Subrahmanian, V.S.: Hybrid Probabilistic Programs: Algorithms and Complexity. In: UAI, pp. 160–169 (1999)
Eiter, T., Lukasiewicz, T.: Probabilistic reasoning about actions in nonmonotonic causal theories. In: UAI, pp. 192–199 (2003)
Eiter, T., et al.: Declarative problem solving in DLV. In: LBAI (2000)
Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for generallogic programs. Journal of ACM 38(3), 620–650 (1991)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICSLP. MIT Press, Cambridge (1988)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 363–385 (1991)
Halpern, J., Pearl, J.: Causes and explanations: A structural-model approach. Part I: Causes. The British Journal for the Philosophy of Science 56(4), 843–887 (2005)
Kersting, K., De Raedt, L.: Bayesian Logic Programs. In: Inductive LP (2000)
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. Journal of Logic Programming 12, 335–367 (1992)
Lakshmanan, L.V.S., Sadri, F.: On a theory of probabilistic deductive databases. Journal of TPLP 1(1), 5–42 (2001)
Loyer, Y., Straccia, U.: The well-founded semantics in normal logic programs with uncertainty. In: Hu, Z., Rodríguez-Artalejo, M. (eds.) FLOPS 2002, vol. 2441. Springer, Heidelberg (2002)
Loyer, Y., Straccia, U.: The approximate well-founded semantics for logic programs with uncertainty. In: Int. Symp. on Math. Found. of CS (2003)
Lukasiewicz, T.: Probabilistic logic programming. In: JELIA, pp. 388–392 (1998)
Lukasiewicz, T.: Many-valued disjunctive logic programs with probabilistic semantics. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730. Springer, Heidelberg (1999)
Fernandez, J., Minker, J.: Disjunctive deductive databases. In: Voronkov, A. (ed.) LPAR 1992, vol. 624. Springer, Heidelberg (1992)
Muggleton, S.: Stochastic logic programming. In: International Workshop on ILP (1995)
Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information &Computation 101(2) (1992)
Ng, R.T., Subrahmanian, V.S.: A semantical framework for supporting subjective and conditional probabilities in deductive databases. ARJ 10(2) (1993)
Ng, R.T., Subrahmanian, V.S.: Stable semantics for probabilistic deductive databases. Information & Computation 110(1) (1994)
Niemela, I., Simons, P.: Efficient implementation of the well-founded and stable model semantics. In: Joint International Conference and Symposium on LP (1996)
Poole, D.: The Independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence 94(1-2), 7–56 (1997)
Poole, D.: Abducing through negation as failure: stable models within the independent choice logic. Journal of Logic Programming 44, 5–35 (2000)
Saad, E.: Incomplete knowlege in hybrid probabilistic logic programs. In: JELIA (2006)
Saad, E., Pontelli, E.: Towards a more practical hybrid probabilistic logic programming framework. In: PADL (2005)
Saad, E., Pontelli, E.: A new approach to hybrid probabilistic logic programs. Annals of Mathematics and Artificial Intelligence Journal 48(3-4), 187–243 (2006)
Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004, vol. 3132. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saad, E. (2007). A Logical Approach to Qualitative and Quantitative Reasoning. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)