Skip to main content Accessibility help
×
Home

Shared aggregate sets in answer set programming

  • MARIO ALVIANO (a1), CARMINE DODARO (a2) and MARCO MARATEA (a2)

Abstract

Aggregates are among the most frequently used linguistic extensions of answer set programming. The result of an aggregation may introduce new constants during the instantiation of the input program, a feature known as value invention. When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined literals. This paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input. The proposed solution reduces the memory footprint of the solver without sacrificing efficiency. On the contrary, the performance of the solver may improve thanks to the addition of some simple entailed clauses which are not easily discovered otherwise, and since redundant computation is avoided during propagation. Empirical evidence of the potential impact of the proposed solution is given.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Shared aggregate sets in answer set programming
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Shared aggregate sets in answer set programming
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Shared aggregate sets in answer set programming
      Available formats
      ×

Copyright

References

Hide All
Aavani, A., Mitchell, D. G., and Ternovska, E. 2013. New encoding for translating pseudo-boolean constraints into SAT. In Symposium on Abstraction, Reformulation, and Approximation. AAAI.
Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., and Mayer-Eichberger, V. 2012. A New Look at BDDs for Pseudo-Boolean Constraints. Journal of Artificial Intelligence Research 45, 443480.
Abío, I. and Stuckey, P. J. 2012. Conflict directed lazy decomposition. In International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 7514. Springer, 7085.
Alviano, M. 2011. Efficient recursive aggregate evaluation in logic programming. Intelligenza Artificiale 5, 2, 207215.
Alviano, M. 2016. Evaluating answer set programming with non-convex recursive aggregates. Fundamenta Informaticae 149, 1–2, 134.
Alviano, M., Calimeri, F., Charwat, G., and et al. 2013. The Fourth Answer Set Programming Competition: Preliminary Report. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 8148. Springer, 4253.
Alviano, M., Calimeri, F., Dodaro, C., Fuscà, D., Leone, N., Perri, S., Ricca, F., Veltri, P., and Zangari, J. 2017. The ASP system DLV2. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 10377. Springer, 215221.
Alviano, M., Calimeri, F., Faber, W., Leone, N., and Perri, S. 2011. Unfounded sets and well-founded semantics of answer set programs with aggregates. Journal of Artificial Intelligence Research 42, 487527.
Alviano, M. and Dodaro, C. 2016a. Anytime answer set optimization via unsatisfiable core shrinking. Theory and Practice of Logic Programming 16, 5–6, 533551.
Alviano, M. and Dodaro, C. 2016b. Completion of disjunctive logic programs. In International Joint Conference on Artificial Intelligence. IJCAI/AAAI Press, 886892.
Alviano, M. and Dodaro, C. 2017. Unsatisfiable core shrinking for anytime answer set optimization. In International Joint Conference on Artificial Intelligence. ijcai.org, 4781–4785.
Alviano, M., Dodaro, C., Faber, W., Leone, N., and Ricca, F. 2013. WASP: A native ASP solver based on constraint learning. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 8148. Springer, 54–66.
Alviano, M., Dodaro, C., Leone, N., and Ricca, F. 2015. Advances in WASP. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 9345. Springer, 4054.
Alviano, M., Dodaro, C., and Ricca, F. 2015. A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size. In International Joint Conference on Artificial Intelligence. AAAI Press, 26772683.
Alviano, M. and Faber, W. 2011. Dynamic magic sets and super-coherent answer set programs. AI Communications 24, 2, 125145.
Alviano, M. and Faber, W. 2013. The complexity boundary of answer set programming with generalized atoms under the FLP semantics. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 8148. Springer, 6772.
Alviano, M., Faber, W., and Gebser, M. 2015. Rewriting recursive aggregates in answer set programming: back to monotonicity. Theory and Practice of Logic Programming 15, 4–5, 559573.
Alviano, M., Faber, W., and Gebser, M. 2016. From non-convex aggregates to monotone aggregates in ASP. In International Joint Conference on Artificial Intelligence. IJCAI/AAAI Press, 41004194.
Alviano, M., Faber, W., Greco, G., and Leone, N. 2012. Magic sets for disjunctive datalog programs. Artificial Intelligence 187, 156192.
Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., and Terracina, G. 2010. The Disjunctive Datalog System DLV. In Datalog Reloaded. Lecture Notes in Computer Science, vol. 6702. Springer, 282301.
Alviano, M., Faber, W., and Strass, H. 2016. Boolean functions with ordered domains in answer set programming. In AAAI Conference on Artificial Intelligence. AAAI Press, 879885.
Alviano, M., Faber, W., and Woltran, S. 2014. Complexity of super-coherence problems in ASP. Theory and Practice of Logic Programming 14, 3, 339361.
Alviano, M., Greco, G., and Leone, N. 2011. Dynamic magic sets for programs with monotone recursive aggregates. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 6645. Springer, 148160.
Alviano, M. and Leone, N. 2015. Complexity and compilation of gz-aggregates in answer set programming. Theory and Practice of Logic Programming 15, 4–5, 574587.
Alviano, M. and Leone, N. 2016. On the properties of gz-aggregates in answer set programming. In International Joint Conference on Artificial Intelligence. IJCAI/AAAI Press, 41054109.
Andres, B., Kaufmann, B., Matheis, O., and Schaub, T. 2012. Unsatisfiability-based optimization in clasp. In Technical Communications of the International Conference on Logic Programming. LIPIcs, vol. 17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 211221.
Bailleux, O., Boufkhad, Y., and Roussel, O. 2009. New encodings of pseudo-boolean constraints into CNF. In The International Conferences on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science, vol. 5584. Springer, 181194.
Banbara, M., Kaufmann, B., Ostrowski, M., and Schaub, T. 2017. Clingcon: The next generation. Theory and Practice of Logic Programming 17, 4, 408461.
Bartholomew, M., Lee, J., and Meng, Y. 2011. First-order semantics of aggregates in answer set programming via modified circumscription. In Logical Formalizations of Commonsense Reasoning AAAI Spring Symposium. AAAI.
Baselice, S., Bonatti, P. A., and Gelfond, M. 2005. Towards an integration of answer set and constraint solving. In International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 3668. Springer, 5266.
Bomanson, J., Gebser, M., and Janhunen, T. 2014. Improving the normalization of weight rules in answer set programs. In European Conference on Logics in Artificial Intelligence. Lecture Notes in Computer Science, vol. 8761. Springer, 166180.
Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., and Schaub, T. 2015. Answer set programming modulo acyclicity. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 9345. Springer, 143150.
Bomanson, J. and Janhunen, T. 2013. Normalizing cardinality rules using merging and sorting constructions. In Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 8148. Springer, 187199.
Brewka, G., Eiter, T., and Truszczynski, M. 2011. Answer set programming at a glance. Communications of the ACM 54, 12, 92103.
Bruynooghe, M., Blockeel, H., Bogaerts, B., de Cat, B., Pooter, S. D., Jansen, J., Labarre, A., Ramon, J., Denecker, M., and Verwer, S. 2015. Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. Theory and Practice of Logic Programming 15, 6, 783817.
Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., and Schaub, T. 2013. ASP-Core-2 Input Language Format.
Calimeri, F., Gebser, M., Maratea, M., and Ricca, F. 2016. Design and results of the Fifth Answer Set Programming Competition. Artificial Intelligence 231, 151181.
Cuteri, B., Dodaro, C., Ricca, F. and Schüller, P. 2017. Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis. Theory and Practice of Logic Programming 17, 5–6, 780799.
Dodaro, C., Alviano, M., Faber, W., Leone, N., Ricca, F., and Sirianni, M. 2011. The birth of a WASP: preliminary report on a new ASP solver. In Italian Conference on Computational Logic. CEUR Workshop Proceedings, vol. 810. CEUR-WS.org, 99–113.
Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca, F., and Schekotihin, K. 2016. Combining answer set programming and domain heuristics for solving hard industrial problems (application paper). Theory and Practice of Logic Programming 16, 5–6, 653669.
Eén, N. and Sörensson, N. 2006. Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1–4, 126.
Faber, W., Leone, N., Maratea, M., and Ricca, F. 2011. Look-back techniques for ASP programs with aggregates. Fundamenta Informaticae 107, 4, 379413.
Faber, W., Pfeifer, G., and Leone, N. 2011. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175, 1, 278298.
Faber, W., Pfeifer, G., Leone, N., Dell'Armi, T., and Ielpa, G. 2008. Design and implementation of aggregate functions in the DLV system. Theory and Practice of Logic Programming 8, 5–6, 545580.
Ferraris, P. 2011. Logic programs with propositional connectives and aggregates. ACM Transactions on Computational Logic 12, 4, 25.
Ferraris, P. and Lifschitz, V. 2005. Weight constraints as nested expressions. Theory and Practice of Logic Programming 5, 1–2, 4574.
Gebser, M., Harrison, A., Kaminski, R., Lifschitz, V., and Schaub, T. 2015. Abstract gringo. Theory and Practice of Logic Programming 15, 4–5, 449463.
Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., and Schaub, T. 2015. Progress in clasp Series 3. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 9345. Springer, 368383.
Gebser, M., Kaminski, R., Kaufmann, B., and Schaub, T. 2009. On the implementation of weight constraint rules in conflict-driven ASP solvers. In International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 5649. Springer, 250264.
Gebser, M., Kaminski, R., König, A., and Schaub, T. 2011. Advances in gringo series 3. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 6645. Springer, 345351.
Gebser, M., Kaufmann, B., Romero, J., Otero, R., Schaub, T., and Wanko, P. 2013. Domain-specific heuristics in answer set programming. In AAAI Conference on Artificial Intelligence. AAAI Press.
Gebser, M., Kaufmann, B., and Schaub, T. 2009. The conflict-driven answer set solver clasp: Progress report. In International Conference Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 5753. Springer, 509514.
Gebser, M., Kaufmann, B., and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 5289.
Gebser, M., Kaufmann, B., and Schaub, T. 2013. Advanced conflict-driven disjunctive answer set solving. In International Joint Conference on Artificial Intelligence. IJCAI/AAAI.
Gebser, M., Maratea, M., and Ricca, F. 2017. The sixth answer set programming competition. Journal of Artificial Intelligence Research 60, 4195.
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Logic Programming. MIT Press, 10701080.
Gelfond, M. and Zhang, Y. 2014. Vicious circle principle and logic programs with aggregates. Theory and Practice of Logic Programming 14, 4–5, 587601.
Giunchiglia, E., Leone, N., and Maratea, M. 2008. On the relation among answer set solvers. Annals of Mathematics and Artificial Intelligence 53, 1–4, 169204.
Giunchiglia, E., Lierler, Y., and Maratea, M. 2006. Answer Set Programming Based on Propositional Satisfiability. Journal of Automated Reasoning 36, 4, 345377.
Janhunen, T. 2006. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16, 1–2, 3586.
Janhunen, T. and Niemelä, I. 2016. The answer set programming paradigm. AI Magazine 37, 3, 1324.
Lierler, Y. and Maratea, M. 2004. Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 2923. Springer, 346350.
Lifschitz, V. 2016. Answer sets and the language of answer set programming. AI Magazine 37, 3, 712.
Liu, L., Pontelli, E., Son, T. C., and Truszczynski, M. 2010. Logic programs with abstract constraint atoms: The role of computations. Artificial Intelligence 174, 3–4, 295315.
Nieuwenhuis, R., Oliveras, A., and Tinelli, C. 2006. Solving SAT and SAT Modulo Theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). Journal of the ACM 53, 6, 937977.
Pelov, N., Denecker, M., and Bruynooghe, M. 2007. Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming 7, 3, 301353.
Simons, P., Niemelä, I., and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1–2, 181234.
Son, T. C. and Pontelli, E. 2007. A constructive semantic characterization of aggregates in answer set programming. Theory and Practice of Logic Programming 7, 3, 355375.

Keywords

Shared aggregate sets in answer set programming

  • MARIO ALVIANO (a1), CARMINE DODARO (a2) and MARCO MARATEA (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed