Introspecting Preferences in Answer Set Programming

Author Zhizheng Zhang

Thumbnail PDF


  • Filesize: 457 kB
  • 13 pages

Document Identifiers

Author Details

Zhizheng Zhang
  • School of Computer Science and Engineering, Southeast University, Nanjing, China

Cite AsGet BibTex

Zhizheng Zhang. Introspecting Preferences in Answer Set Programming. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 3:1-3:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


This paper develops a logic programming language, ASP^EP, that extends answer set programming language with a new epistemic operator >~_x where x in {#,supseteq}. The operator are used between two literals in rules bodies, and thus allows for the representation of introspections of preferences in the presence of multiple belief sets: G >~_# F expresses that G is preferred to F by the cardinality of the sets, and G >~_supseteq F expresses G is preferred to F by the set-theoretic inclusion. We define the semantics of ASP^EP, explore the relation to the languages of strong introspections, and study the applications of ASP^EP by modeling the Monty Hall problem and the principle of majority.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Logic programming and answer set programming
  • Answer Set
  • Preference
  • Introspection


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Marcello Balduccini and Michael Gelfond. Logic Programs with Consistency-Restoring Rules. In International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series, pages 9-18, 2003. Google Scholar
  2. Ronen I. Brafman and Carmel Domshlak. Preference Handling - An Introductory Tutorial. AI Magazine, 30(1):58-86, 2009. URL:
  3. Gerhard Brewka. Answer Sets and Qualitative Optimization. Logic Journal of the IGPL, 14(3):413-433, 2006. URL:
  4. Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic Programs with Ordered Disjunction. Computational Intelligence, 20(2):335-357, 2004. URL:
  5. Gerhard Brewka, Ilkka Niemelä, and Miroslaw Truszczynski. Answer Set Optimization. In IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9-15, 2003, pages 867-872, 2003. URL:
  6. Luis Fariñas Del Cerro, Andreas Herzig, and Ezgi Iraz Su. Epistemic equilibrium logic. In Proc. 24th Int. Joint Conference on Artificial Intelligence (IJCAI-15), pages 2964-2970, 2015. Google Scholar
  7. James P. Delgrande, Torsten Schaub, Hans Tompits, and Kewen Wang. A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence, 20(2):308-334, 2004. URL:
  8. Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci, and Henri Prade. Preferences in AI: An overview. Artif. Intell., 175(7-8):1037-1052, 2011. URL:
  9. Wolfgang Faber, Gerald Pfeifer, Nicola Leone, Tina Dell'armi, and Giuseppe Ielpa. Design and Implementation of Aggregate Functions in the DLV System. Theory Pract. Log. Program., 8(5-6):545-580, November 2008. URL:
  10. Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven Answer Set Solving: From Theory to Practice. Artif. Intell., 187-188:52-89, August 2012. URL:
  11. Michael Gelfond. Strong Introspection. In Thomas L. Dean and Kathleen McKeown, editors, Proceedings of the 9th National Conference on Artificial Intelligence, Anaheim, CA, USA, July 14-19, 1991, Volume 1., pages 386-391. AAAI Press / The MIT Press, 1991. URL:
  12. Michael Gelfond. Logic Programming and Reasoning with Incomplete Information. Ann. Math. Artif. Intell., 12(1-2):89-116, 1994. URL:
  13. Michael Gelfond. New semantics for epistemic specifications. In Logic Programming and Nonmonotonic Reasoning, pages 260-265. Springer, 2011. Google Scholar
  14. Michael Gelfond and Yulia Kahl. Knowledge Representation, Reasoning, and the Design of Intelligent Agents. Cambridge Unversity Press, 2014. Google Scholar
  15. Judy Goldsmith and Ulrich Junker. Preference Handling for Artificial Intelligence. AI Magazine, 29(4):9-12, 2008. URL:
  16. Patrick Kahl, Richard Watson, Michael Gelfond, and Yuanlin Zhang. A Refinement of the Language of Epistemic Specifications. Journal of Logic and Computation, 2015. URL:
  17. Pascal Nicolas, Laurent Garcia, Igor Stéphan, and Claire Lefèvre. Possibilistic uncertainty handling for answer set programming. Ann. Math. Artif. Intell., 47(1-2):139-181, 2006. URL:
  18. Gabriella Pigozzi, Alexis Tsoukiàs, and Paolo Viappiani. Preferences in artificial intelligence. Ann. Math. Artif. Intell., 77(3-4):361-401, 2016. URL:
  19. Chiaki Sakama and Katsumi Inoue. Prioritized logic programming and its application to commonsense reasoning. Artif. Intell., 123(1-2):185-222, 2000. URL:
  20. Torsten Schaub and Kewen Wang. A semantic framework for preference handling in answer set programming. TPLP, 3(4-5):569-607, 2003. URL:
  21. Steve Selvin. A problem in probability (letter to the editor). American Statistician, 29:67, 1975. Google Scholar
  22. Yi-Dong Shen and Thomas Eiter. Evaluating epistemic negation in answer set programming. Artificial Intelligence, 237:115-135, 2016. Google Scholar
  23. Yidong Shen, Kewen Wang, and Thomas Eiter. FLP answer set semantics without circular justifications for general logic programs. Artificial Intelligence, 213:1-41, 2014. Google Scholar
  24. Mirosław Truszczyński. Revisiting epistemic specifications. In Logic programming, knowledge representation, and nonmonotonic reasoning, pages 315-333. Springer, 2011. Google Scholar
  25. G. H. Von Wright. The logic of preference reconsidered. Theory and Decision, 3(2):140-169, 1972. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail