{"type":"ScholarlyArticle","title":"Possibilistic ASP Base Revision by Certain Input","authors":[{"name":"Laurent Garcia","slug":"laurent-garcia","given":"Laurent","family":"Garcia","affiliation":"LERIA , Université d'Angers , France"},{"name":"Claire Lefèvre","slug":"claire-lefevre","given":"Claire","family":"Lefèvre","affiliation":"LERIA , Université d'Angers , France"},{"name":"Odile Papini","slug":"odile-papini","given":"Odile","family":"Papini","affiliation":"Aix Marseille Univ , Université de Toulon , CNRS , LIS , Marseille , France"},{"name":"Igor Stéphan","slug":"igor-stephan","given":"Igor","family":"Stéphan","affiliation":"LERIA , Université d'Angers , France"},{"name":"Eric Würbel","slug":"eric-wurbel","given":"Eric","family":"Würbel","affiliation":"Aix Marseille Univ , Université de Toulon , CNRS , LIS , Marseille , France"}],"abstract":"Belief base revision has been studied within the answer set programming framework. We go a step further by introducing uncertainty and studying belief base revision when beliefs are represented by possibilistic logic programs under possibilistic answer set semantics and revised by certain input. The paper proposes two approaches of rule-based revision operators and presents their semantic characterization in terms of possibilistic distribution. This semantic characterization allows for equivalently considering the evolution of syntactic logic programs and the evolution of their semantic content. It then studies the logical properties of the proposed operators and gives complexity results.","doi":"10.24963/ijcai.2018/252","url":"https://ijcai.org/proceedings/2018/252","pdf":"https://ijcai.org/proceedings/2018/0252.pdf","markdown":"https://ijcai.org/proceedings/2018/252.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/252","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":252,"pages":{"first":1824,"last":1830},"keywords":["Knowledge Representation and Reasoning: Non-monotonic Reasoning","Knowledge Representation and Reasoning: Reasoning about Knowlege and Belief","Uncertainty in AI: Uncertainty Representations","Knowledge Representation and Reasoning: Belief Change"],"videos":[],"references":[{"position":1,"raw":"[Alchourrón and Makinson, 1985] C. E. Alchourrón and D. Makinson. On the logic of theory change : Safe con- traction. Studia Logica, 44(4):14-37, 1985.","title":"On the logic of theory change : Safe contraction","authors":"C E Alchourrón, D Makinson","year":"1985","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baget et al., 2016] J.-F. Baget, Z. Bouraoui, F. Nouioua, O. Papini, S. Rocher, and E. Würbel. ∃-ASP for computing repairs with existential ontologies. In Proc. of SUM'16, pages 230-245, 2016.","title":"∃-ASP for computing repairs with existential ontologies","authors":"J.-F Baget, Z Bouraoui, F Nouioua, O Papini, S Rocher, E Würbel","year":"2016","venue":"Proc. of SUM'16","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baget et al., 2018] J.-F. Baget, L. Garcia, F. Garreau, C. Lefèvre, S. Rocher, and I. Stéphan. Bringing existen- tial variables in answer set programming and bringing non- monotony in existential rules: two sides of the same coin. Annals of Mathematics and Artificial Intelligence, 82(1- 3):3-42, 2018.","title":"Bringing existential variables in answer set programming and bringing nonmonotony in existential rules: two sides of the same coin","authors":"J.-F Baget, L Garcia, F Garreau, C Lefèvre, S Rocher, I Stéphan","year":"2018","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baral et al., 2009] C. Baral, M. Gelfond, and J. N. Rush- ton. Probabilistic reasoning with answer sets. Theory and Practice of Logic Programming, 9(1):57-144, 2009.","title":"Probabilistic reasoning with answer sets","authors":"C Baral, M Gelfond, J N Rushton","year":"2009","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bauters et al., 2010] K. Bauters, S. Schockaert, M. De Cock, and D. Vermeir. Possibilistic answer set program- ming revisited. In Proc. of UAI'10, pages 48-55, 2010.","title":"Possibilistic answer set programming revisited","authors":"K Bauters, S Schockaert, M De Cock, D Vermeir","year":"2010","venue":"Proc. of UAI'10","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bauters et al., 2015] K. Bauters, S. Schockaert, M. De Cock, and D. Vermeir. Characterizing and extending an- swer set semantics using possibility theory. Theory and Practice of Logic Programming, 15(1):79-116, 2015.","title":"Characterizing and extending answer set semantics using possibility theory","authors":"K Bauters, S Schockaert, M De Cock, D Vermeir","year":"2015","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Benferhat and Bouraoui, 2017] S. Benferhat and Z. Bouraoui. Min-based possibilistic DL-Lite. Jour- nal of Logic and Computation, 27(1):261-297, 2017.","title":"Min-based possibilistic DL-Lite","authors":"S Benferhat, Z Bouraoui","year":"2017","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[de Morais and Finger, 2013] E. Menezes de Morais and M. Finger. Probabilistic answer set programming. In Proc. of Brazilian Conference on Intelligent Systems, BRACIS'13, pages 150-156, 2013.","title":"Probabilistic answer set programming","authors":"E Menezes De Morais, M Finger","year":"2013","venue":"Proc. of Brazilian Conference on Intelligent Systems, BRACIS'13","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Delgrande et al., 2013] J. P. Delgrande, P. Peppas, and S. Woltran. AGM-style belief revision of logic programs under answer set semantics. In Proc. of LPNMR'13, pages 264-276, 2013.","title":"AGM-style belief revision of logic programs under answer set semantics","authors":"J P Delgrande, P Peppas, S Woltran","year":"2013","venue":"Proc. of LPNMR'13","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dubois and Prade, 1988] D. Dubois and H. Prade. Possibil- ity theory. Plenum Press, New-York, 1988.","title":"Possibility theory","authors":"D Dubois, H Prade","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dubois and Prade, 1998] D. Dubois and H. Prade. Possi- bility theory: Qualitative and quantitative aspects. Hand- book of Defeasible Reasoning and Uncertainty Manage- ment Systems, 1:169-226, 1998.","title":"Possibility theory: Qualitative and quantitative aspects","authors":"D Dubois, H Prade","year":"1998","venue":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dubois and Prade, 2001] D. Dubois and H. Prade. Possibil- ity theory, probability theory and multiple-valued logics: A clarification. Annals of Mathematics and Artificial In- telligence, 32(1-4):35-66, 2001.","title":"Possibility theory, probability theory and multiple-valued logics: A clarification","authors":"D Dubois, H Prade","year":"2001","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Eiter et al., 2008] T. Eiter, G. Ianni, T. Lukasiewicz, R. Schindlauer, and H. Tompits. Combining answer set programming with description logics for the semantic web. Artificial Intelligence, 172(12-13):1495-1539, 2008.","title":"Combining answer set programming with description logics for the semantic web","authors":"T Eiter, G Ianni, T Lukasiewicz, R Schindlauer, H Tompits","year":"2008","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Garcia et al., 2017] L. Garcia, C. Lefèvre, O. Papini, I. Stéphan, and E. Würbel. A semantic characterization for ASP base revision. In Proc. of SUM'17, pages 334-347, 2017.","title":"A semantic characterization for ASP base revision","authors":"L Garcia, C Lefèvre, O Papini, I Stéphan, E Würbel","year":"2017","venue":"Proc. of SUM'17","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gelfond and Lifschitz, 1988] M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of ICLP'88, pages 1070-1080, 1988.","title":"The stable model semantics for logic programming","authors":"M Gelfond, V Lifschitz","year":"1988","venue":"Proc. of ICLP'88","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hansson, 1999] S. O. Hansson. A textbook of belief dynam- ics. Theory change and database updating. Kluwer, 1999.","title":"A textbook of belief dynamics. Theory change and database updating","authors":"S O Hansson","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hué et al., 2013] J. Hué, O. Papini, and E. Würbel. Extend- ing belief base change to logic programs with ASP. In Trends in Belief Revision and Argumentation Dynamics, Studies in Logic. 2013.","title":"Extending belief base change to logic programs with ASP","authors":"J Hué, O Papini, E Würbel","year":"2013","venue":"Trends in Belief Revision and Argumentation Dynamics","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Katsuno and Mendelzon, 1991] H. Katsuno and A. O. Mendelzon. Propositional knowledge base revision and minimal change. Artificial Intelligence, 52(3):263-294, 1991.","title":"Propositional knowledge base revision and minimal change","authors":"H Katsuno, A O Mendelzon","year":"1991","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Krümpelmann and Kern-Isberner, 2012] P. Krümpelmann and G. Kern-Isberner. Belief base change operations for answer set programming. In Proc. of JELIA'12, pages 294-306, 2012.","title":"Belief base change operations for answer set programming","authors":"P Krümpelmann, G Kern-Isberner","year":"2012","venue":"Proc. of JELIA'12","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lopes et al., 2017] C. Lopes, M. Knorr, and J. Leite. Nohr: Integrating XSB prolog with the OWL 2 profiles and be- yond. In Proc. of LPNMR'17, pages 236-249, 2017.","title":"Nohr: Integrating XSB prolog with the OWL 2 profiles and beyond","authors":"C Lopes, M Knorr, J Leite","year":"2017","venue":"Proc. of LPNMR'17","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Motik and Rosati, 2010] B. Motik and R. Rosati. Recon- ciling description logics and rules. Journal of the ACM, 57(5):30:1-30:62, 2010.","title":"Reconciling description logics and rules","authors":"B Motik, R Rosati","year":"2010","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Nicolas et al., 2005] P. Nicolas, L. Garcia, and I. Stéphan. Possibilistic stable models. In Proc. of IJCAI'05, pages 248-253, 2005.","title":"Possibilistic stable models","authors":"P Nicolas, L Garcia, I Stéphan","year":"2005","venue":"Proc. of IJCAI'05","doi":null,"url":null,"internal_url":"/proceedings/2005/7"},{"position":23,"raw":"[Nicolas et al., 2006] P. Nicolas, L. Garcia, I. Stéphan, and C. Lefèvre. Possibilistic uncertainty handling for answer set programming. Annals of Mathematics and Artificial Intelligence, 47(1-2):139-181, 2006.","title":"Possibilistic uncertainty handling for answer set programming","authors":"P Nicolas, L Garcia, I Stéphan, C Lefèvre","year":"2006","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Papadimitriou, 1994] C. H. Papadimitriou. Computational Complexity, chapter 17, page 412.","title":"Computational Complexity","authors":"C H Papadimitriou","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Schaub, 2008] T. Schaub. Here's the beef: Answer set pro- gramming ! In Proc. of ICLP'08, pages 93-98, 2008.","title":"Here's the beef: Answer set programming !","authors":"T Schaub","year":"2008","venue":"Proc. of ICLP'08","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Slota and Leite, 2014] M. Slota and J. Leite. The rise and fall of semantic rule updates based on SE-models. The- ory and Practice of Logic Programming, 14(6):869-907, 2014.","title":"The rise and fall of semantic rule updates based on SE-models","authors":"M Slota, J Leite","year":"2014","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Turner, 2003] H. Turner. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming, 3:609-622, 2003.","title":"Strong equivalence made easy: nested expressions and weight constraints","authors":"H Turner","year":"2003","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Wang and Lee, 2015] Y. Wang and J. Lee. Handling uncer- tainty in answer set programming. In Proc. of AAAI'15, pages 4218-4219, 2015.","title":"Handling uncertainty in answer set programming","authors":"Y Wang, J Lee","year":"2015","venue":"Proc. of AAAI'15","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Zhuang et al., 2016] Z. Zhuang, J. P. Delgrande, A. C. Nayak, and A. Sattar. Reconsidering agm-style belief revi- sion in the context of logic programs. In Proc. of ECAI'16, pages 671-679, 2016.","title":"Reconsidering agm-style belief revision in the context of logic programs","authors":"Z Zhuang, J P Delgrande, A C Nayak, A Sattar","year":"2016","venue":"Proc. of ECAI'16","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}