publication . Preprint . 2013

Probability Aggregates in Probability Answer Set Programming

Saad, Emad;
Open Access English
  • Published: 05 Apr 2013
Abstract
Probability answer set programming is a declarative programming that has been shown effective for representing and reasoning about a variety of probability reasoning tasks. However, the lack of probability aggregates, e.g. {\em expected values}, in the language of disjunctive hybrid probability logic programs (DHPP) disallows the natural and concise representation of many interesting problems. In this paper, we extend DHPP to allow arbitrary probability aggregates. We introduce two types of probability aggregates; a type that computes the expected value of a classical aggregate, e.g., the expected value of the minimum, and a type that computes the probability of...
Subjects
free text keywords: Computer Science - Artificial Intelligence
Download from
18 references, page 1 of 2

[Burdick et al., 2007] D. Burdick, P. Deshpande, T.S. Jayram, R. Ramakrishnan, and S. Vaithyanathan. Olap over uncertain and imprecise data. VLDB, 16(1):123-144, 2007.

[Faber et al., 2010] W. Faber, N. Leone, and G. Pfeifer. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence, 2010.

[Ferraris and Lifschitz, 2005] P. Ferraris and V. Lifschitz. Weight constraints as nested expressions. TPLP, 5:45-74, 2005.

[Ferraris and Lifschitz, 2010] P. Ferraris and V. Lifschitz. On the stable model semantics of first-order formulas with aggregates. In Nonmonotonic Reasoning, 2010.

[Gelfond and Lifschitz, 1991] M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3- 4):363-385, 1991. [OpenAIRE]

[Jayram et al., 2007] T.S. Jayram, S. Kale, and E. Vee. Efficient aggregation algorithms for probabilistic data. In Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007.

[Niemela and Simons, 2000] I. Niemela and P. Simons. Extending the smodels system with cardinality and weight constraints. In In Jack Minker, editor, LogicBased AI, pages 491-521, 2000.

[Pelov and Truszczynski, 2004] N. Pelov and M. Truszczynski. Semantics of disjunctive programs with monotone aggregates - an operator-based approach. In NMR, 2004. [OpenAIRE]

[Pelov et al., 2007] N. Pelov, M. Denecker, and M. Bruynooghe. Well-fouded and stable semantics of logic programs with aggregates. TPLP, 7:355 - 375, 2007. [OpenAIRE]

[Pelov, 2004] N. Pelov. Semantics of logic programs with aggregates. PhD thesis, Katholieke Univer-siteit Leuven, Leuven, Belgium, 2004. [OpenAIRE]

[Re and Suciu, 2009] C. Re and D. Suciu. The trichotomy of having queries on a probabilistic database. VLDB, 2009. [OpenAIRE]

[Saad and Pontelli, 2006] E. Saad and E. Pontelli. A new approach to hybrid probabilistic logic programs. Annals of Mathematics and Artificial Intelligence, 48(3-4):187-243, 2006.

[Saad, 2006] E. Saad. Incomplete knowlege in hybrid probability logic programs. In 10th European Conference on Logics in Artificial Intelligence, 2006.

[Saad, 2007a] E. Saad. A logical approach to qualitative and quantitative reasoning. In 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2007.

[Saad, 2007b] E. Saad. Probability planning in hybrid probability logic programs. In 1st International Conference on Scalable Uncertainty Management, 2007.

18 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue