Probability Aggregates in Probability Answer Set Programming

Subject: Computer Science  Artificial Intelligence

References
(18)
18 references, page 1 of 2
 1
 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):123144, 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:4574, 2005.
[Ferraris and Lifschitz, 2010] P. Ferraris and V. Lifschitz. On the stable model semantics of firstorder 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):363385, 1991.
[Jayram et al., 2007] T.S. Jayram, S. Kale, and E. Vee. Efficient aggregation algorithms for probabilistic data. In Eighteenth Annual ACMSIAM 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 491521, 2000.
[Pelov and Truszczynski, 2004] N. Pelov and M. Truszczynski. Semantics of disjunctive programs with monotone aggregates  an operatorbased approach. In NMR, 2004.
[Pelov et al., 2007] N. Pelov, M. Denecker, and M. Bruynooghe. Wellfouded and stable semantics of logic programs with aggregates. TPLP, 7:355  375, 2007.
[Pelov, 2004] N. Pelov. Semantics of logic programs with aggregates. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 2004.
 Similar Research Results (2)

Metrics
No metrics available

 Download from


Cite this publication