{"type":"ScholarlyArticle","title":"Query Answering in Propositional Circumscription","authors":[{"name":"Mario Alviano","slug":"mario-alviano","given":"Mario","family":"Alviano","affiliation":"University of Calabria"}],"abstract":"Propositional circumscription defines a preference relation over the models of a propositional theory, so that models being subset-minimal on the interpretation of a set of objective atoms are preferred.The complexity of several computational tasks increase by one level in the polynomial hierarchy due to such a preference relation;among them there is query answering, which amounts to decide whether there is an optimal model satisfying the query.A complete algorithm for query answering is obtained by searching for a model, not necessarily an optimal one, that satisfies the query, and such that no model unsatisfying the query is more preferred.If the query or its complement are among the objective atoms, the algorithm has a simpler behavior, which is also described in the paper.Moreover, an incomplete algorithm is obtained by searching for a model satisfying both the query and an objective atom being unit-implied by the theory extended with the complement of the query.A prototypical implementation is tested on instances from the 2nd International Competition on Computational Models of Argumentation (ICCMA'17).","doi":"10.24963/ijcai.2018/231","url":"https://ijcai.org/proceedings/2018/231","pdf":"https://ijcai.org/proceedings/2018/0231.pdf","markdown":"https://ijcai.org/proceedings/2018/231.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/231","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":231,"pages":{"first":1669,"last":1675},"keywords":["Knowledge Representation and Reasoning: Computational Models of Argument","Knowledge Representation and Reasoning: Non-classical Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"[Alviano and Dodaro, 2016] Mario Alviano and Carmine Dodaro. Anytime answer set optimization via unsatisfi- able core shrinking. TPLP, 16(5-6):533-551, 2016.","title":"Anytime answer set optimization via unsatisfiable core shrinking","authors":"Mario Alviano, Carmine Dodaro","year":"2016","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alviano and Dodaro, 2017] Mario Alviano and Carmine Dodaro. Unsatisfiable core shrinking for anytime answer set optimization. In Carles Sierra, editor, IJCAI 2017, Mel- bourne, Australia, August 19-25, 2017, pages 4781-4785, 2017.","title":"Unsatisfiable core shrinking for anytime answer set optimization","authors":"Mario Alviano, Carmine Dodaro","year":"2017","venue":"IJCAI 2017","doi":null,"url":null,"internal_url":"/proceedings/2017/666"},{"position":3,"raw":"[Alviano et al., 2013] Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, and Francesco Ricca. WASP: A native ASP solver based on constraint learn- ing. In Pedro Cabalar and Tran Cao Son, editors, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceed- ings, volume 8148 of LNCS, pages 54-66. Springer, 2013.","title":"WASP: A native ASP solver based on constraint learning","authors":"Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca","year":"2013","venue":"LPNMR 2013","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alviano et al., 2014] Mario Alviano, Carmine Dodaro, and Francesco Ricca. Anytime computation of cautious conse- quences in answer set programming. TPLP, 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":"TPLP","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Alviano et al., 2015a] Mario Alviano, Carmine Dodaro, Nicola Leone, and Francesco Ricca. Advances in WASP. In Francesco Calimeri, Giovambattista Ianni, and Miroslaw Truszczynski, editors, LPNMR 2015, Lexington, KY, USA, September 27-30, 2015. Proceedings, volume 9345 of LNCS, pages 40-54. Springer, 2015.","title":"Advances in WASP","authors":"Alviano","year":"2015","venue":"LPNMR 2015","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Alviano et al., 2015b] Mario Alviano, Carmine Dodaro, and Francesco Ricca. A maxsat algorithm using cardi- nality constraints of bounded size. In Qiang Yang and Michael Wooldridge, editors, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 2677-2683. AAAI Press, 2015.","title":"A maxsat algorithm using cardinality constraints of bounded size","authors":"Alviano","year":"2015","venue":"IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/379"},{"position":7,"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. CoRR, abs/1804.08480, 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":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Alviano, 2017a] Mario Alviano. The ingredients of the argumentation reasoner pyglaf: Python, circumscription, and glucose to taste. In Marco Maratea and Ivan Serina, editors, RCRA 2017, Bari, Italy, November 14-15, 2017, volume 2011 of CEUR Workshop Proceedings, pages 1- 16. CEUR-WS.org, 2017.","title":"The ingredients of the argumentation reasoner pyglaf: Python, circumscription, and glucose to taste","authors":"Mario Alviano, Alviano","year":"2011","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Alviano, 2017b] Mario Alviano. Model enumeration in propositional circumscription via unsatisfiable core anal- ysis. TPLP, 17(5-6):708-725, 2017.","title":"Model enumeration in propositional circumscription via unsatisfiable core analysis","authors":"Mario Alviano, Alviano","year":"2017","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Alviano, 2017c] Mario Alviano. The pyglaf argumentation reasoner. In Ricardo Rocha, Tran Cao Son, Christopher Mears, and Neda Saeedloei, editors, ICLP 2017, August 28 to September 1, 2017, Melbourne, Australia, volume 58 of OASICS, pages 2:1-2:3. Schloss Dagstuhl -Leibniz- Zentrum fuer Informatik, 2017.","title":"The pyglaf argumentation reasoner","authors":"Mario Alviano, Alviano","year":"2017","venue":"ICLP 2017","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Audemard and Simon, 2009] Gilles Audemard and Laurent Simon. Predicting learnt clauses quality in modern SAT solvers. In Craig Boutilier, editor, IJCAI 2009, Pasadena, California, USA, July 11-17, 2009, pages 399-404, 2009.","title":"Predicting learnt clauses quality in modern SAT solvers","authors":"Simon ; Audemard, Gilles Audemard, Laurent Simon","year":"2009","venue":"IJCAI 2009","doi":null,"url":null,"internal_url":"/proceedings/2009/74"},{"position":12,"raw":"[Cerutti et al., 2013] Federico Cerutti, Paul E. Dunne, Mas- similiano Giacomin, and Mauro Vallati. Computing pre- ferred extensions in abstract argumentation: A sat-based approach. In Elizabeth Black, Sanjay Modgil, and Nir Oren, editors, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers, volume 8306 of LNCS, pages 176-193. Springer, 2013.","title":"Computing preferred extensions in abstract argumentation: A sat-based approach","authors":"Federico Cerutti, Paul E Dunne, Massimiliano Giacomin, Mauro Vallati","year":"2013","venue":"TAFA 2013","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Dodaro et al., 2011] Carmine Dodaro, Mario Alviano, Wolfgang Faber, Nicola Leone, Francesco Ricca, and Marco Sirianni. The birth of a WASP: preliminary report on a new ASP solver. In Fabio Fioravanti, editor, CILC 2011, Pescara, Italy, August 31 -September 2, 2011, vol- ume 810 of CEUR Workshop Proceedings, pages 99-113. CEUR-WS.org, 2011.","title":"The birth of a WASP: preliminary report on a new ASP solver","authors":"Carmine Dodaro, Mario Alviano, Wolfgang Faber, Nicola Leone, Francesco Ricca, Marco Sirianni","year":"2011","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dvorák et al., 2014] Wolfgang Dvorák, Matti Järvisalo, Jo- hannes Peter Wallner, and Stefan Woltran. Complexity- sensitive decision procedures for abstract argumentation. Artif. Intell., 206:53-78, 2014.","title":"Complexitysensitive decision procedures for abstract argumentation","authors":"Dvorák","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Egly et al., 2010] Uwe Egly, Sarah Alice Gaggl, and Ste- fan Woltran. Answer-set programming encodings for argumentation frameworks. Argument & Computation, 1(2):147-177, 2010.","title":"Answer-set programming encodings for argumentation frameworks","authors":"Uwe Egly, Sarah Alice Gaggl, Stefan Woltran","year":"2010","venue":"Argument & Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Eiter and Gottlob, 1993] Thomas Eiter and Georg Gott- lob. Propositional circumscription and extended closed- world reasoning are iip2-complete. Theor. Comput. Sci., 114(2):231-245, 1993.","title":"Propositional circumscription and extended closedworld reasoning are iip2-complete","authors":"Thomas Eiter, Georg Gottlob","year":"1993","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gaggl et al., 2016] Sarah Alice Gaggl, Thomas Linsbichler, Marco Maratea, and Stefan Woltran. Introducing the sec- ond international competition on computational models of argumentation. In Matthias Thimm, Federico Cerutti, Hannes Strass, and Mauro Vallati, editors, SAFA, Potsdam, Germany, September 13, 2016., volume 1672 of CEUR Workshop Proceedings, pages 4-9. CEUR-WS.org, 2016.","title":"Introducing the second international competition on computational models of argumentation","authors":"Gaggl","year":"2016","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Jannach et al., 2016] Dietmar Jannach, Thomas Schmitz, and Kostyantyn M. Shchekotykhin. Parallel model-based diagnosis on multi-core computers. J. Artif. Intell. Res. (JAIR), 55:835-887, 2016.","title":"Shchekotykhin. Parallel model-based diagnosis on multi-core computers","authors":"Dietmar Jannach, Thomas Schmitz, M Kostyantyn","year":"2016","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Junker, 2004] Ulrich Junker. QUICKXPLAIN: preferred explanations and relaxations for over-constrained prob- lems. In Deborah L. McGuinness and George Ferguson, editors, Proceedings of the Nineteenth National Confer- ence on Artificial Intelligence, Sixteenth Conference on In- novative Applications of Artificial Intelligence, July 25-29, 2004, San Jose, California, USA, pages 167-172. AAAI Press / The MIT Press, 2004.","title":"QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems","authors":"Ulrich Junker, Junker","year":"2004","venue":"Proceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lifschitz, 1986] Vladimir Lifschitz. On the satisfiability of circumscription. Artif. Intell., 28(1):17-27, 1986.","title":"On the satisfiability of circumscription","authors":"Vladimir Lifschitz","year":"1986","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Marques-Silva et al., 2013] João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, and Anton Belov. On computing minimal correction subsets. In Francesca Rossi, editor, IJCAI 2013, Beijing, China, Au- gust 3-9, 2013, pages 615-622. IJCAI/AAAI, 2013.","title":"On computing minimal correction subsets","authors":"João Marques-Silva, Federico Heras, Mikolás Janota, Alessandro Previti, Anton Belov","year":"2013","venue":"IJCAI 2013","doi":null,"url":null,"internal_url":"/proceedings/2013/98"},{"position":22,"raw":"[McCarthy, 1980] John McCarthy. Circumscription -A form of non-monotonic reasoning. Artif. Intell., 13(1-2):27-39, 1980.","title":"Circumscription -A form of non-monotonic reasoning","authors":"John Mccarthy","year":"1980","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Mencía et al., 2015] Carlos Mencía, Alessandro Previti, and João Marques-Silva. Literal-based MCS extraction. In Qiang Yang and Michael Wooldridge, editors, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 1973-1979. AAAI Press, 2015.","title":"Literal-based MCS extraction","authors":"Carlos Mencía, Alessandro Previti, João Marques-Silva","year":"2015","venue":"IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/280"},{"position":24,"raw":"[Morgado et al., 2013] António Morgado, Federico Heras, Mark H. Liffiton, Jordi Planes, and João Marques-Silva. Iterative and core-guided maxsat solving: A survey and assessment. Constraints, 18(4):478-534, 2013.","title":"Iterative and core-guided maxsat solving: A survey and assessment","authors":"António Morgado, Federico Heras, Mark H Liffiton, Jordi Planes, João Marques-Silva","year":"2013","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Oikarinen and Janhunen, 2005] Emilia Oikarinen and Tomi Janhunen. circ2dlp -translating circumscription into dis- junctive logic programming. In Chitta Baral, Gianluigi Greco, Nicola Leone, and Giorgio Terracina, editors, LP- NMR 2005, Diamante, Italy, September 5-8, 2005, volume 3662 of LNCS, pages 405-409. Springer, 2005.","title":"circ2dlp -translating circumscription into disjunctive logic programming","authors":"Janhunen Oikarinen, Emilia Oikarinen, Tomi Janhunen","year":"2005","venue":"LP-NMR 2005","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pereira et al., 1993] Luís Moniz Pereira, Carlos Viegas Damásio, and José Júlio Alferes. Debugging by diagnos- ing assumptions. In Peter Fritszon, editor, AADEBUG'93, Linköping, Sweden, May 3-5, 1993, Proceedings, volume 749 of LNCS, pages 58-74. Springer, 1993.","title":"Debugging by diagnosing assumptions","authors":"Luís Moniz Pereira, Carlos Viegas Damásio, José Júlio, Alferes","year":"1993","venue":"AADEBUG'93","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Romero et al., 2016] Javier Romero, Torsten Schaub, and Philipp Wanko. Computing diverse optimal stable mod- els. In Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos, editors, ICLP 2016 TCs, October 16-21, 2016, New York City, USA, volume 52 of OASICS, pages 3:1-3:14. Schloss Dagstuhl -Leibniz-Zentrum fuer Infor- matik, 2016.","title":"Computing diverse optimal stable models","authors":"Javier Romero, Torsten Schaub, Philipp Wanko","year":"2016","venue":"ICLP 2016 TCs","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}