{"type":"ScholarlyArticle","title":"Considering Constraint Monotonicity and Foundedness in Answer Set Programming","authors":[{"name":"Yi-Dong Shen","slug":"yi-dong-shen","given":"Yi-Dong","family":"Shen","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing 100190 , China"},{"name":"Thomas Eiter","slug":"thomas-eiter","given":"Thomas","family":"Eiter","affiliation":"Institute of Logic and Computation , Vienna University of Technology (TU Wien) , Favoritenstraße 9-11 , A-1040 Vienna , Austria"}],"abstract":"Should the properties of constraint monotonicity and foundedness be mandatory requirements that every answer set and world view semantics must satisfy?  This question is challenging and has incurred a debate in answer set programming (ASP).  In this paper we address the question by introducing natural logic programs whose expected answer sets and world views violate these properties and thus may be viewed as counter-examples to these requirements.  Specifically we use instances of the generalized strategic companies problem for ASP benchmark competitions as concrete examples to demonstrate that the requirements of constraint monotonicity and foundedness may exclude expected answer sets for some simple disjunctive programs and world views for some epistemic specifications. In conclusion these properties should not be mandatory conditions for an answer set and world view semantics in general.","doi":"10.24963/ijcai.2022/380","url":"https://ijcai.org/proceedings/2022/380","pdf":"https://ijcai.org/proceedings/2022/0380.pdf","markdown":"https://ijcai.org/proceedings/2022/380.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/380","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":380,"pages":{"first":2741,"last":2747},"keywords":["Knowledge Representation and Reasoning: Non-monotonic Reasoning","Knowledge Representation and Reasoning: Reasoning about Knowledge and Belief","Knowledge Representation and Reasoning: Logic Programming"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986609","length_sec":88,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984752","length_sec":363,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Cabalar et al., 2019] Pedro Cabalar, Jorge Fandinno, and Luis Fariñas del Cerro. Splitting epistemic logic programs. In Proc. LPNMR 2019, pages 120-133, 2019.","title":"Pedro Cabalar, Jorge Fandinno, and Luis Fariñas del Cerro. Splitting epistemic logic programs","authors":"Cabalar","year":"2019","venue":"Proc. LPNMR 2019","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Cabalar et al., 2020] Pedro Cabalar, Jorge Fandinno, and Luis Fariñas del Cerro. Autoepistemic answer set pro- gramming. Artif. Intell., 289:103382, 2020.","title":"Autoepistemic answer set programming","authors":"Pedro Cabalar, Jorge Fandinno, Luis Fariñas Del Cerro","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cadoli et al., 1997] Marco Cadoli, Thomas Eiter, and Georg Gottlob. Default logic as a query language. IEEE TKDE, 9(3):448-463, 1997.","title":"Default logic as a query language","authors":"Marco Cadoli, Thomas Eiter, Georg Gottlob","year":"1997","venue":"IEEE TKDE","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Costantini, 2021] Stefania Costantini. Top-down splitting property for epistemic logic programs. In Proceedings of the International Conference on Logic Programming 2021 Workshops, volume 2970 of CEUR Workshop Pro- ceedings. CEUR-WS.org, 2021.","title":"Top-down splitting property for epistemic logic programs","authors":"Stefania Costantini","year":"2021","venue":"Proceedings of the International Conference on Logic Programming 2021 Workshops","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[del Cerro et al., 2015] Luis Fariñas del Cerro, Andreas Herzig, and Ezgi Iraz Su. Epistemic equilibrium logic. In Proc. IJCAI 2015, pages 2964-2970, 2015.","title":"Epistemic equilibrium logic","authors":"Del Cerro","year":"2015","venue":"Proc. IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/419"},{"position":6,"raw":"[Faber et al., 2011] Wolfgang Faber, Gerald Pfeifer, and Nicola Leone. Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell., 175(1):278-298, 2011.","title":"Semantics and complexity of recursive aggregates in answer set programming","authors":"Faber","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fandinno et al., 2021] Jorge Fandinno, Wolfgang Faber, and Michael Gelfond. Thirty years of epistemic specifi- cations. CoRR, abs/2108.07669, 2021.","title":"Thirty years of epistemic specifications","authors":"Jorge Fandinno, Wolfgang Faber, Michael Gelfond","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ferraris et al., 2011] Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz. Stable models and circumscription. Artif. Intell., 175(1):236-263, 2011.","title":"Stable models and circumscription","authors":"Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gelfond and Kah, 2014] Michael Gelfond and Yulia Kah. Knowledge Representation, Reasoning, and the Design of Intelligent Agents. Cambridge University Press, 2014.","title":"Knowledge Representation, Reasoning, and the Design of Intelligent Agents","authors":"Kah Gelfond, Michael Gelfond, Yulia Kah","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. ICLP 1988, pages 1070- 1080, 1988.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proc. ICLP 1988","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gelfond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic pro- grams and disjunctive databases. New Generation Computing, 9:365-385, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gelfond, 1991] Michael Gelfond. Strong introspection. In Proc. AAAI 1991, pages 386-391, 1991.","title":"Strong introspection","authors":"Michael Gelfond","year":"1991","venue":"Proc. AAAI 1991","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gelfond, 2008] Michael Gelfond. Answer sets. In Hand- book of Knowledge Representation, pages 285-316. 2008.","title":"Answer sets","authors":"Michael Gelfond","year":"2008","venue":"Handbook of Knowledge Representation","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hecher et al., 2020] Markus Hecher, Michael Morak, and Stefan Woltran. Structural decompositions of epistemic logic programs. In Proc. AAAI 2020, pages 2830-2837, 2020.","title":"Structural decompositions of epistemic logic programs","authors":"Markus Hecher, Michael Morak, Stefan Woltran","year":"2020","venue":"Proc. AAAI 2020","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Kahl and Leclerc, 2018] Patrick Thor Kahl and Anthony Leclerc. Epistemic logic programs with world view con- straints. In Proc. ICLP 2018, pages 1-17, 2018.","title":"Epistemic logic programs with world view constraints","authors":"Leclerc ; Kahl, Thor Patrick, Anthony Kahl, Leclerc","year":"2018","venue":"Proc. ICLP 2018","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kahl et al., 2019] Patrick Thor Kahl, Anthony P. Leclerc, and Tran Cao Son. A parallel memory-efficient epistemic logic program solver: harder, better, faster. Ann. Math. Artif. Intell., 86(1-3):61-85, 2019.","title":"A parallel memory-efficient epistemic logic program solver: harder, better, faster","authors":"Kahl","year":"2019","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kahl et al., 2020] Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, and Yuanlin Zhang. The language of epistemic specifications (refined) including a prototype solver. Journal of Logic and Computation, 30(4):953-989, 2020.","title":"The language of epistemic specifications (refined) including a prototype solver","authors":"Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, Yuanlin Zhang","year":"2020","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kahl, 2014] Patrick Thor Kahl. Refining the semantics for epistemic logic programs. PhD thesis, Texas Tech Univ., USA, 2014.","title":"Refining the semantics for epistemic logic programs","authors":"; Kahl, Thor Patrick, Kahl","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Leone et al., 1997] Nicola Leone, Pasquale Rullo, and Francesco Scarcello. Disjunctive stable models: Un- founded sets, fixpoint semantics, and computation. Infor- mation and Compututation, 135(2):69-112, 1997.","title":"Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation","authors":"Nicola Leone, Pasquale Rullo, Francesco Scarcello","year":"1997","venue":"Information and Compututation","doi":null,"url":null,"internal_url":null},{"position":20,"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 repsentation and reasoning. ACM Trans. Comput. Logic, 7(3):499-562, July 2006.","title":"The dlv system for knowledge repsentation and reasoning","authors":"Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello","year":"2006","venue":"ACM Trans. Comput. Logic","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lifschitz et al., 1999] Vladimir Lifschitz, Lappoon Tang, and Hudson Turner. Nested expressions in logic programs. Ann. Math. Artif. Intell., 25(1-2):369-389, 1999.","title":"Nested expressions in logic programs","authors":"Vladimir Lifschitz, Lappoon Tang, Hudson Turner","year":"1999","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lifschitz et al., 2001] Vladimir Lifschitz, David Pearce, and Agustín Valverde. Strongly equivalent logic programs. ACM Trans. on Computat. Logic, 2(4):526-541, 2001.","title":"Strongly equivalent logic programs","authors":"Vladimir Lifschitz, David Pearce, Agustín Valverde","year":"2001","venue":"ACM Trans. on Computat. Logic","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lifschitz, 2019] Vladimir Lifschitz. Answer Set Program- ming. Springer, 2019.","title":"Answer Set Programming","authors":"Vladimir Lifschitz","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pearce, 2006] David Pearce. Equilibrium logic. Ann. Math. Artif. Intell., 47(1-2):3-41, 2006.","title":"Equilibrium logic","authors":"David Pearce","year":"2006","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Shen and Eiter, 2016] Yi-Dong Shen and Thomas Eiter. Evaluating epistemic negation in answer set programming. Artif. Intell., 237:115-135, 2016.","title":"Evaluating epistemic negation in answer set programming","authors":"Yi-Dong Shen, Thomas Eiter","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Shen and Eiter, 2019] Yi-Dong Shen and Thomas Eiter. De- termining inference semantics for disjunctive logic pro- grams. Artif. Intell., 277:1-28, 2019.","title":"Determining inference semantics for disjunctive logic programs","authors":"Yi-Dong Shen, Thomas Eiter","year":"2019","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Shen and Eiter, 2020] Yi-Dong Shen and Thomas Eiter. Constraint monotonicity, epistemic splitting and founded- ness are too strong in answer set programming. CoRR, abs/2010.00191, 2020.","title":"Constraint monotonicity, epistemic splitting and foundedness are too strong in answer set programming","authors":"Yi-Dong Shen, Thomas Eiter","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Shen et al., 2014] Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwall- ner, and Jun Deng. FLP answer set semantics without cir- cular justifications for general logic programs. Artif. In- tell., 213:1-41, 2014.","title":"FLP answer set semantics without circular justifications for general logic programs","authors":"Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner, Jun Deng","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Su et al., 2020] Ezgi Iraz Su, Luis Fariñas del Cerro, and Andreas Herzig. Autoepistemic equilibrium logic and epistemic specifications. Artif. Intell., 282:103-249, 2020.","title":"Autoepistemic equilibrium logic and epistemic specifications","authors":"Iraz Ezgi, Luis Fariñas Su, Andreas Del Cerro, Herzig","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Su, 2021] Ezgi Iraz Su. Refining the semantics of epistemic specifications. In Proc. ICLP 2021, pages 113-126, 2021.","title":"Refining the semantics of epistemic specifications","authors":"Ezgi Iraz, Su","year":"2021","venue":"Proc. ICLP 2021","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Truszczynski, 2010] Miroslaw Truszczynski. Reducts of propositional theories, satisfiability relations, and gener- alizations of semantics of logic programs. Artif. Intell., 174(16-17):1285-1306, 2010.","title":"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs","authors":"Miroslaw Truszczynski","year":"2010","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}