Hostname: page-component-5447f9dfdb-84kf5 Total loading time: 0 Render date: 2025-07-30T20:57:21.100Z Has data issue: false hasContentIssue false
  • English
  • Français

Translating LPOD and CR-Prolog2 into standard answer set programs

Published online by Cambridge University Press:  10 August 2018

JOOHYUNG LEE  and
ZHUN YANG
JOOHYUNG LEE
Affiliation:
School of Computing, Informatics and Decision Systems EngineeringArizona State University, Tempe, USA (e-mails: joolee@asu.edu, zyang90@asu.edu)
ZHUN YANG
Affiliation:
School of Computing, Informatics and Decision Systems EngineeringArizona State University, Tempe, USA (e-mails: joolee@asu.edu, zyang90@asu.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog2 is an extension of standard answer set programs with consistency restoring rules and LPOD-like ordered disjunction. We present reductions of each of these languages into the standard ASP language, which gives us an alternative way to understand the extensions in terms of the standard ASP language.

Information

Type
Original Article
Information
Theory and Practice of Logic Programming , Volume 18 , Special Issue 3-4: 34th International Conference on Logic Programming , July 2018 , pp. 589 - 606
Copyright
Copyright © Cambridge University Press 2018 

References

Asuncion, V., Zhang, Y., and Zhang, H. 2014. Logic programs with ordered disjunction: first-order semantics and expressiveness. In Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press, 2–11.Google Scholar
Balduccini, M., Balduccini, M., and Mellarkod, V. 2003. CR-Prolog with ordered disjunction. In In ASP03 Answer Set Programming: Advances in Theory and Implementation, volume 78 of CEUR Workshop proceedings.Google Scholar
Balduccini, M. 2007. CR-MODELS: an inference engine for CR-Prolog. In Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning. Springer-Verlag, 18–30.Google Scholar
Balduccini, M. and Gelfond, M. 2003. Logic programs with consistency-restoring rules. In International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series. 9–18.Google Scholar
Balduccini, M. and Mellarkod, V. 2004. A-Prolog with CR-rules and ordered disjunction. In Intelligent Sensing and Information Processing, 2004. Proceedings of International Conference on. IEEE, 1–6.Google Scholar
Brewka, G. 2002. Logic programming with ordered disjunction. In AAAI/IAAI. 100–105.Google Scholar
Brewka, G. 2005. Preferences in answer set programming. In CAEPIA. Vol. 4177. Springer, 1–10.Google Scholar
Brewka, G., Delgrande, J. P., Romero, J., and Schaub, T. 2015. asprin: Customizing answer set preferences without a headache. In AAAI. 1467–1474.Google Scholar
Brewka, G., Niemelä, I., and Syrjänen, T. 2002. Implementing ordered disjunction using answer set solvers for normal programs. In European Workshop on Logics in Artificial Intelligence. Springer, 444–456.Google Scholar
Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., and Schaub, T. 2012. ASP-Core-2: Input language format. ASP Standardization Working Group, Tech. Rep.Google Scholar
Delgrande, J. P., Schaub, T., and Tompits, H. 2003. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming 3, 2, 129–187.Google Scholar
Ferraris, P. 2011. Logic programs with propositional connectives and aggregates. ACM Transactions on Computational Logic (TOCL) 12, 4, 25.Google Scholar
Ferraris, P., Lee, J., Lifschitz, V., and Palla, R. 2009. Symmetric splitting in the general theory of stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). 797–803.Google Scholar
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385.Google Scholar
Lee, J. and Yang, Z. 2018. Online appendix for the paper “Translating LPOD and CR-Prolog2 into standard answer set programs".Google Scholar
Supplementary material: PDF

Lee and Yang supplementary material

Online Appendix

Download Lee and Yang supplementary material(PDF)
PDF 345.5 KB