Skip to main content Accessibility help
×
Home

Cautious reasoning in ASP via minimal models and unsatisfiable cores

  • MARIO ALVIANO (a1), CARMINE DODARO (a2), MATTI JÄRVISALO (a3), MARCO MARATEA (a4) and ALESSANDRO PREVITI (a5)...

Abstract

Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting—among other reasoning modes—the central task of query answering. In the propositional case, query answering amounts to computing cautious consequences of the input program among the atoms in a given set of candidates, where a cautious consequence is an atom belonging to all stable models. Currently, the most efficient algorithms either iteratively verify the existence of a stable model of the input program extended with the complement of one candidate, where the candidate is heuristically selected, or introduce a clause enforcing the falsity of at least one candidate, so that the solver is free to choose which candidate to falsify at any time during the computation of a stable model. This paper introduces new algorithms for the computation of cautious consequences, with the aim of driving the solver to search for stable models discarding more candidates. Specifically, one of such algorithms enforces minimality on the set of true candidates, where different notions of minimality can be used, and another takes advantage of unsatisfiable cores computation. The algorithms are implemented in wasp, and experiments on benchmarks from the latest ASP competitions show that the new algorithms perform better than the state of the art.

    • 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.

      Cautious reasoning in ASP via minimal models and unsatisfiable cores
      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.

      Cautious reasoning in ASP via minimal models and unsatisfiable cores
      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.

      Cautious reasoning in ASP via minimal models and unsatisfiable cores
      Available formats
      ×

Copyright

References

Hide All
Alviano, M. 2017a. Model enumeration in propositional circumscription via unsatisfiable core analysis. Theory and Practice of Logic Programming 17, 5–6, 708725.
Alviano, M. 2017b. The pyglaf argumentation reasoner. In Technical Communications of the International Conference on Logic Programming. OASICS, vol. 58. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2:12:3.
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. and Dodaro, C. 2016. Anytime answer set optimization via unsatisfiable core shrinking. Theory and Practice of Logic Programming 16, 5–6, 533551.
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, 5466.
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., Marques-Silva, J., and Ricca, F. 2015. Optimum stable model search: algorithms and implementation. Journal of Logic and Computation. To appear.
Alviano, M., Dodaro, C., and Ricca, F. 2014. Anytime computation of cautious consequences in answer set programming. Theory and Practice of Logic Programming 14, 4–5, 755770.
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., Faber, W., Greco, G., and Leone, N. 2012. Magic sets for disjunctive datalog programs. Artificial Intelligence 187, 156192.
Alviano, M., Faber, W., and Leone, N. 2010. Disjunctive ASP with functions: Decidable queries and effective computation. Theory and Practice of Logic Programming 10, 4–6, 497512.
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.
Amendola, G., Dodaro, C., Faber, W., Leone, N., and Ricca, F. 2017. On the computation of paracoherent answer sets. In AAAI Conference on Artificial Intelligence. AAAI Press, 10341040.
Arenas, M., Bertossi, L. E., and Chomicki, J. 2003. Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming 3, 4–5, 393424.
Baral, C. 2010. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
Brewka, G. and Eiter, T. 2007. Equilibria in heterogeneous nonmonotonic multi-context systems. In AAAI Conference on Artificial Intelligence. AAAI Press, 385390.
Brewka, G., Eiter, T., and Truszczynski, M. 2011. Answer set programming at a glance. Communications of the ACM 54, 12, 92103.
Brewka, G., Roelofsen, F., and Serafini, L. 2007. Contextual default reasoning. In International Joint Conference on Artificial Intelligence. 268–273.
Brochenin, R. and Maratea, M. 2015. Abstract answer set solvers for cautious reasoning. In Technical Communications of the International Conference on Logic Programming. CEUR Workshop Proceedings, vol. 1433. CEUR-WS.org.
Bry, F. and Yahya, A. H. 2000. Positive unit hyperresolution tableaux and their application to minimal model generation. Journal of Automated Reasoning 25, 1, 3582.
Calimeri, F., Gebser, M., Maratea, M., and Ricca, F. 2016. Design and results of the Fifth Answer Set Programming Competition. Artificial Intelligence 231, 151181.
Calimeri, F., Ianni, G., and Ricca, F. 2014. The third open answer set programming competition. Theory and Practice of Logic Programming 14, 1, 117135.
DI ROSA, E., Giunchiglia, E., and Maratea, M. 2010. Solving satisfiability problems with preferences. Constraints 15, 4, 485515.
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, Fioravanti, F., Ed. CEUR Workshop Proceedings, vol. 810. CEUR-WS.org, 99113.
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.
Eiter, T. 2005. Data integration and answer set programming. In International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Computer Science, vol. 3662. Springer, 1325.
Eiter, T., Gottlob, G., and Mannila, H. 1997. Disjunctive datalog. ACM Transactions on Database Systems 22, 3, 364418.
Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., and Tompits, H. 2008. Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172, 12–13, 14951539.
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, desJardins, M. and Littman, M. L., Eds. AAAI Press.
Gebser, M., Kaufmann, B., and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 5289.
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 International Conference and Symposium on Logic Programming. MIT Press, 10701080.
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3/4, 365386.
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.
Hasegawa, R., Fujita, H., and Koshimura, M. 2000. Efficient minimal model generation using branching lemmas. In International Conference on Automated Deduction. Lecture Notes in Computer Science, vol. 1831. Springer, 184199.
Janhunen, T. and Niemelä, I. 2016. The answer set programming paradigm. AI Magazine 37, 3, 1324.
Janota, M., Lynce, I. and Marques-Silva, J. 2015. Algorithms for computing backbones of propositional formulae. AI Communications 28, 2, 161177.
Janota, M. and Marques-Silva, J. 2016. On the query complexity of selecting minimal sets for monotone predicates. Artificial Intelligence 233, 7383.
Kaufmann, B., Leone, N., Perri, S., and Schaub, T. 2016. Grounding and solving in answer set programming. AI Magazine 37, 3, 2532.
Koshimura, M., Nabeshima, H., Fujita, H., and Hasegawa, R. 2009. Minimal model generation with respect to an atom set. In International Workshop on First-Order Theorem Proving. CEUR Workshop Proceedings, vol. 556. CEUR-WS.org.
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., and Scarcello, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3, 499562.
Lifschitz, V. 2016. Answer sets and the language of answer set programming. AI Magazine 37, 3, 712.
Manna, M., Ricca, F., and Terracina, G. 2013. Consistent query answering via ASP from different perspectives: Theory and practice. Theory and Practice of Logic Programming 13, 2, 227252.
Manna, M., Ricca, F., and Terracina, G. 2015. Taming primary key violations to query large inconsistent data via ASP. Theory and Practice of Logic Programming 15, 4–5, 696710.
Marek, V. and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. Springer, 375398.
Niemelä, I. 1996. A tableau calculus for minimal model reasoning. In International Workshop on Theorem Proving with Analytic Tableaux and Related Methods. Lecture Notes in Computer Science, vol. 1071. Springer, 278294.
Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3–4, 241273.
Previti, A. and Järvisalo, M. 2018. A preference-based approach to backbone computation with application to argumentation. In ACM/SIGAPP Symposium on Applied Computing. ACM. To appear.
Silva, J. P. M. and Sakallah, K. A. 1999. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48, 5, 506521.
Zhu, C. S., Weissenbacher, G., Sethi, D., and Malik, S. 2011. SAT-based techniques for determining backbones for post-silicon fault localisation. In IEEE International High Level Design Validation and Test Workshop. IEEE Computer Society, 8491.

Keywords

Cautious reasoning in ASP via minimal models and unsatisfiable cores

  • MARIO ALVIANO (a1), CARMINE DODARO (a2), MATTI JÄRVISALO (a3), MARCO MARATEA (a4) and ALESSANDRO PREVITI (a5)...

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