Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-23T12:21:25.294Z Has data issue: false hasContentIssue false
  • English
  • Français

About Epistemic Negation and World Views in Epistemic Logic Programs

Published online by Cambridge University Press:  20 September 2019

STEFANIA COSTANTINI Open the ORCID record for STEFANIA COSTANTINI [Opens in a new window]
STEFANIA COSTANTINI*
Affiliation:
DISIM - Università dell’Aquila, Italy (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with “ epistemic operators” and “ epistemic negation”, and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on the existence and number of world views. We show how to exploit an extended ASP semantics in order to: (i) provide a characterization of world views, different from existing ones; (ii) query world views and query the whole set of world views.

Keywords

Answer Set ProgrammingEpistemic Logic ProgramsEpistemic Negation
Type
Original Article
Information
Theory and Practice of Logic Programming , Volume 19 , Special Issue 5-6: 35th International Conference on Logic Programming , September 2019 , pp. 790 - 807
Copyright
© Cambridge University Press 2019 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Bichler, M., Morak, M., and Woltran, S. 2018. Single-shot epistemic logic program solving. In Proc. of the Twenty-Seventh Intl. Joint Conf. on Artificial Intelligence, IJCAI 2018, J. Lang, Ed. ijcai.org, 1714–1720.Google Scholar
Bordini, R. H., Braubach, L., Dastani, M., Fallah-Seghrouchni, A. E., Gómez-Sanz, J. J., Leite, J., O’Hare, G. M. P., Pokahr, A., and Ricci, A. 2006. A survey of programming languages and platforms for multi-agent systems. Informatica (Slovenia) 30, 1, 33–44.Google Scholar
Bowen, K. and Kowalski, R. A. 1983. Amalgamating language and metalanguage in logic programming. In Logic Programming, K. Clark and S. A. Tarnlund, Eds. Academic Press.Google Scholar
Brass, S., Dix, J., Freitag, B., and Zukowski, U. 2001. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming 1, 5, 497–538.Google Scholar
Brewka, G., Eiter, T., and Truszczyński, M. (eds.) 2016. Answer set programming: Special issue. AI Magazine 37, 3: 5–6.Google Scholar
Cabalar, P., Fandinno, J., and del Cerro, L. F. 2019a. Founded world views with autoepistemic equilibrium logic. In Logic Programming and Nonmonotonic Reasoning - 15th Intl. Conf., LPNMR 2019, Proceedings, M. Balduccini, Y. Lierler, and S. Woltran, Eds. Lecture Notes in Computer Science, vol. 11481. 134–147.Google Scholar
Cabalar, P., Fandinno, J., and del Cerro, L. F. 2019b. Splitting epistemic logic programs. In Logic Programming and Nonmonotonic Reasoning - 15th Intl. Conf., LPNMR 2019, Proceedings, M. Balduccini, Y. Lierler, and S. Woltran, Eds. Lecture Notes in Computer Science, vol. 11481. 120–133.Google Scholar
Chen, W. and Warren, D. S. 1993. A goal-oriented approach to computing the well-founded semantics. Journal of Logic Programming 17, 2/3&4, 279–300.Google Scholar
Cholewinski, P. and Truszczynski, M. 1999. Extremal problems in logic programming and stable model computation. Journal of Logic Programming 38, 2, 219–242.Google Scholar
Costantini, S. 2006. On the existence of stable models of non-stratified logic programs. Theory and Practice of Logic Programming 6, 1–2.Google Scholar
Costantini, S. 2011. Answer set modules for logical agents. In Datalog Reloaded - First Intl. Workshop, Datalog 2010, Revised Selected Papers, O. de Moor, G. Gottlob, T. Furche, and A. J. Sellers, Eds. Number 6702 in Lecture Notes in Computer Science. Springer, 37–58.Google Scholar
Costantini, S. and Formisano, A. 2015. Negation as a resource: a novel view on answer set semantics. Fundamenta Informaticae 140, 3-4, 279–305.Google Scholar
Costantini, S. and Formisano, A. 2016. Query answering in resource-based answer set semantics. Theory and Practice of Logic Programming 16, 5-6, 619–635.Google Scholar
Costantini, S. and Provetti, A. 2005. Normal forms for answer sets programming. Theory and Practice of Logic Programming 5, 6, 747–760.Google Scholar
del Cerro, L. F., Herzig, A., and Su, E. I. 2015. Epistemic equilibrium logic. In Proceedings of the Twenty-Fourth Intl. Joint Conf. on Artificial Intelligence, IJCAI 2015, Q. Yang and M. Wooldridge, Eds. AAAI Press, 2964–270.Google Scholar
Dix, J. 1995. A classification theory of semantics of normal logic programs I-II. Fundamenta Informaticae 22, 3, 227–255 and 257–288.Google Scholar
Faber, W., Pfeifer, G., and Leone, N. 2011. Semantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence 175, 1, 278–298.Google Scholar
Gelfond, M. 2011. New semantics for epistemic specifications. In Logic Programming and Nonmonotonic Reasoning - 11th Intl. Conf., LPNMR 2011, Proceedings, J. P. Delgrande and W. Faber, Eds. Lecture Notes in Computer Science, vol. 6645. Springer, 260–265.Google Scholar
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th Intl. Conf. and Symposium on Logic Programming, R. Kowalski and K. Bowen, Eds. MIT Press, 1070–1080.Google Scholar
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385.Google Scholar
Gelfond, M. and Przymusinska, H. 1991. Definitions in epistemic specifications. In Logic Programming and Non-monotonic Reasoning, Proceedings of the First Intl. Workshop, A. Nerode, V. W. Marek, and V. S. Subrahmanian, Eds. The MIT Press, 245–259.Google Scholar
Kahl, P. T. and Leclerc, A. P. 2018. Epistemic logic programs with world view constraints. In Technical Communications of the 34th Intl. Conf. on Logic Programming, ICLP 2018, A. D. Palù, P. Tarau, N. Saeedloei, and P. Fodor, Eds. OASIcs, vol. 64. Schloss Dagstuhl, 1:1–1:17.Google Scholar
Lloyd, J. W. 1987. Foundations of Logic Programming. Springer-Verlag.Google Scholar
Marek, V. W. and Truszczyski, M. 1993. Reflective autoepistemic logic and logic programming. In LPNMR, Logic Programming and Non-monotonic Reasoning, Proc. of the Second Intl. Workshop, A. Nerode and L. M. Pereira, Eds. The MIT Press, 115–131.Google Scholar
Shen, Y. and Eiter, T. 2016. Evaluating epistemic negation in answer set programming. Artificial Intelligence 237, 115–135.Google Scholar
Son, T. C., Le, T., Kahl, P. T., and Leclerc, A. P. 2017. On computing world views of epistemic logic programs. In Proc. of the Twenty-Sixth Intl. Joint Conf. on Artificial Intelligence, IJCAI 2017, C. Sierra, Ed. ijcai.org, 1269–1275.Google Scholar
Su, E. I. 2017. A monotonic view on reflexive autoepistemic reasoning. In Logic Programming and Nonmonotonic Reasoning - 14th Intl. Conf., LPNMR 2017, Proceedings, M. Balduccini and T. Janhunen, Eds. Lecture Notes in Computer Science, vol. 10377. Springer, 85–100.Google Scholar
Su, E. I. 2019. Epistemic answer set programming. In Logics in Artificial Intelligence - 16th European Conf., JELIA 2019, Proceedings, F. Calimeri, N. Leone, and M. Manna, Eds. Lecture Notes in Computer Science, vol. 11468. Springer, 608–626.Google Scholar
Swift, T. and Warren, D. S. 2012. XSB: Extending prolog with tabled logic programming. Theory and Practice of Logic Programming 12, 1-2, 157–187.Google Scholar
Truszczynski, M. Revisiting epistemic specifications. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, M. Balduccini and T. C. Son, Eds.Google Scholar
Van Gelder, A., Ross, K. A., and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620–650.Google Scholar