{"type":"ScholarlyArticle","title":"A Formal Approach for Cautious Reasoning in Answer Set Programming (Extended Abstract)","authors":[{"name":"Giovanni Amendola","slug":"giovanni-amendola","given":"Giovanni","family":"Amendola","affiliation":"DeMaCS , University of Calabria , Italy"},{"name":"Carmine Dodaro","slug":"carmine-dodaro","given":"Carmine","family":"Dodaro","affiliation":"DeMaCS , University of Calabria , Italy"},{"name":"Marco Maratea","slug":"marco-maratea","given":"Marco","family":"Maratea","affiliation":"DIBRIS , University of Genoa , Italy"}],"abstract":"The issue of describing in a formal way solving algorithms in various fields such as Propositional Satisfiability (SAT), Quantified SAT, Satisfiability Modulo Theories, Answer Set Programming (ASP), and Constraint ASP, has been relatively recently solved employing abstract solvers.\r\nIn this paper we deal with cautious reasoning tasks in ASP, and design, implement and test novel abstract solutions, borrowed from backbone computation in SAT. By employing abstract solvers, we also formally show that the algorithms for solving cautious reasoning tasks in ASP are strongly related to those for computing backbones of Boolean formulas. Some of the new solutions have been implemented in the ASP solver WASP, and tested.","doi":"10.24963/ijcai.2020/652","url":"https://ijcai.org/proceedings/2020/652","pdf":"https://ijcai.org/proceedings/2020/0652.pdf","markdown":"https://ijcai.org/proceedings/2020/652.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/652","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":652,"pages":{"first":4716,"last":4720},"keywords":["Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Non-monotonic Reasoning, Common-Sense Reasoning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24566/file_24566.m3u8","length_sec":299,"provider":"hls"}],"references":[{"position":1,"raw":"[Alviano et al., 2014] Mario Alviano, Carmine Dodaro, and Francesco Ricca. Anytime computation of cautious con- sequences in answer set programming. Theory Pract. Log. Program., 14(4-5):755-770, 2014.","title":"Anytime computation of cautious consequences in answer set programming","authors":"Mario Alviano, Carmine Dodaro, Francesco Ricca","year":"2014","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alviano et al., 2015] Mario Alviano, Carmine Dodaro, Nicola Leone, and Francesco Ricca. Advances in WASP. In Proc. of LPNMR, volume 9345 of Lecture Notes in Computer Science, pages 40-54. Springer, 2015.","title":"Advances in WASP","authors":"Mario Alviano, Carmine Dodaro, Nicola Leone, Francesco Ricca","year":"2015","venue":"Proc. of LPNMR","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alviano et al., 2018] Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, and Alessandro Previti. Cautious reasoning in ASP via minimal models and unsat- isfiable cores. Theory Pract. Log. Program., 18(3-4):319- 336, 2018.","title":"Cautious reasoning in ASP via minimal models and unsatisfiable cores","authors":"Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, Alessandro Previti","year":"2018","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alviano et al., 2019] Mario Alviano, Giovanni Amendola, Carmine Dodaro, Nicola Leone, Marco Maratea, and Francesco Ricca. Evaluation of disjunctive programs in WASP. In Proc. of LPNMR, volume 11481 of Lecture Notes in Computer Science, pages 241-255. Springer, 2019.","title":"Evaluation of disjunctive programs in WASP","authors":"Mario Alviano, Giovanni Amendola, Carmine Dodaro, Nicola Leone, Marco Maratea, Francesco Ricca","year":"2019","venue":"Proc. of LPNMR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Amendola et al., 2019] Giovanni Amendola, Carmine Do- daro, and Marco Maratea. Abstract solvers for computing cautious consequences of ASP programs. Theory Pract. Log. Program., 19(5-6):740-756, 2019.","title":"Abstract solvers for computing cautious consequences of ASP programs","authors":"Giovanni Amendola, Carmine Dodaro, Marco Maratea","year":"2019","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Arenas et al., 2003] Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. Answer sets for consistent query an- swering in inconsistent databases. Theory Pract. Log. Pro- gram., 3(4-5):393-424, 2003.","title":"Answer sets for consistent query answering in inconsistent databases","authors":"Marcelo Arenas, Leopoldo E Bertossi, Jan Chomicki","year":"2003","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brewka and Eiter, 2007] Gerhard Brewka and Thomas Eiter. Equilibria in heterogeneous nonmonotonic multi- context systems. In Proc. of AAAI, pages 385-390. AAAI Press, 2007.","title":"Equilibria in heterogeneous nonmonotonic multicontext systems","authors":"Eiter Brewka, Gerhard Brewka, Thomas Eiter","year":"2007","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brochenin and Maratea, 2015a] Rémi Brochenin and Marco Maratea. Abstract answer set solvers for cautious reasoning. In Proc. of ICLP, volume 1433 of CEUR Workshop Proceedings. CEUR-WS.org, 2015.","title":"Abstract answer set solvers for cautious reasoning","authors":"Maratea Brochenin, Rémi Brochenin, Marco Maratea","year":"2015","venue":"CEUR Workshop Proceedings. CEUR-WS.org","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Brochenin and Maratea, 2015b] Rémi Brochenin and Marco Maratea. Abstract solvers for quantified boolean formulas and their applications. In Proc. of AI*IA, volume 9336 of Lecture Notes in Computer Science, pages 205-217. Springer, 2015.","title":"Abstract solvers for quantified boolean formulas and their applications","authors":"Maratea Brochenin, Rémi Brochenin, Marco Maratea","year":"2015","venue":"Proc. of AI*IA","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Brochenin et al., 2014] Remì Brochenin, Yuliya Lierler, and Marco Maratea. Abstract disjunctive answer set solvers. In Proceedings of ECAI 2014, volume 263 of Frontiers in Artificial Intelligence and Applications, pages 165-170. IOS Press, 2014.","title":"Remì Brochenin, Yuliya Lierler, and Marco Maratea. Abstract disjunctive answer set solvers","authors":"Brochenin","year":"2014","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Di Rosa et al., 2008] Emanuele Di Rosa, Enrico Giunchiglia, and Marco Maratea. A new approach for solving satisfiability problems with qualitative pref- erences. In Proc. of ECAI, volume 178 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2008.","title":"A new approach for solving satisfiability problems with qualitative preferences","authors":"Emanuele Di, Rosa, Enrico Giunchiglia, Marco Maratea","year":"2008","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Eiter et al., 2008] Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, and Hans Tom- pits. Combining answer set programming with descrip- tion logics for the semantic web. Artif. Intell., 172(12- 13):1495-1539, 2008.","title":"Combining answer set programming with descrip-tion logics for the semantic web","authors":"Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer, Hans Tompits","year":"2008","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Eiter, 2005] Thomas Eiter. Data integration and answer set programming. In Proc. of LPNMR, volume 3662 of Lec- ture Notes in Computer Science, pages 13-25. Springer, 2005.","title":"Data integration and answer set programming","authors":"Thomas Eiter","year":"2005","venue":"Proc. of LPNMR","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gebser et al., 2012] Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187:52-89, 2012.","title":"Conflict-driven answer set solving: From theory to practice","authors":"Gebser","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gebser et al., 2017] Martin Gebser, Marco Maratea, and Francesco Ricca. The sixth answer set programming competition. Journal of Artificial Intelligence Research, 60:41-95, 2017.","title":"The sixth answer set programming competition","authors":"Gebser","year":"2017","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. of ICLP/SLP, pages 1070-1080, Cambridge, Mass., 1988. MIT Press.","title":"The Stable Model Semantics for Logic Programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proc. of ICLP/SLP","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Janota et al., 2015] Mikolás Janota, Inês Lynce, and Joao Marques-Silva. Algorithms for computing backbones of propositional formulae. AI Comm., 28(2):161-177, 2015.","title":"Algorithms for computing backbones of propositional formulae","authors":"Janota","year":"2015","venue":"AI Comm","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Leone et al., 2006] Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The DLV system for knowledge rep- resentation and reasoning. ACM TOCL, 7(3):499-562, 2006.","title":"The DLV system for knowledge representation and reasoning","authors":"Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello","year":"2006","venue":"ACM TOCL","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lierler and Truszczynski, 2011] Yuliya Lierler and Miroslaw Truszczynski. Transition systems for model generators -a unifying approach. Theory Pract. Log. Program., 11(4-5):629-646, 2011.","title":"Transition systems for model generators -a unifying approach","authors":"Yuliya Lierler, Miroslaw Truszczynski","year":"2011","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lierler, 2011] Yuliya Lierler. Abstract answer set solvers with backjumping and learning. Theory Pract. Log. Pro- gram., 11:135-169, 2011.","title":"Abstract answer set solvers with backjumping and learning","authors":"Yuliya Lierler","year":"2011","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lierler, 2014] Yuliya Lierler. Relating constraint answer set programming languages and algorithms. Artif. Intell., 207:1-22, 2014.","title":"Relating constraint answer set programming languages and algorithms","authors":"Yuliya Lierler","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Manna et al., 2013] Marco Manna, Francesco Ricca, and Giorgio Terracina. Consistent query answering via ASP from different perspectives: Theory and practice. Theory Pract. Log. Program., 13(2):227-252, 2013.","title":"Consistent query answering via ASP from different perspectives: Theory and practice","authors":"Marco Manna, Francesco Ricca, Giorgio Terracina","year":"2013","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Nieuwenhuis et al., 2006] Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam- Logemann-Loveland procedure to DPLL(T). Journal of the ACM, 53(6):937-977, 2006.","title":"Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T)","authors":"Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli","year":"2006","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}