Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 8
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Nieves, Juan Carlos and Lindgren, Helena 2015. Possibilistic nested logic programs and strong equivalence. International Journal of Approximate Reasoning, Vol. 59, p. 1.

    Benhamou, B. and Siegel, P. 2012. 2012 IEEE 24th International Conference on Tools with Artificial Intelligence. p. 572.

    Osorio, Mauricio and Zepeda, Claudia 2008. 18th International Conference on Electronics, Communications and Computers (conielecomp 2008). p. 59.

    Osorio Galindo, M. Arrazola Ramirez, J. R. and Carballido, J. L. 2008. Logical Weak Completions of Paraconsistent Logics. Journal of Logic and Computation, Vol. 18, Issue. 6, p. 913.

    Guadarrama, J. C. Acosta 2007. 2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session (MICAI). p. 3.

    Osorio, Mauricio Navarro Pérez, Juan Antonio and Arrazola, José 2005. Safe beliefs for propositional theories. Annals of Pure and Applied Logic, Vol. 134, Issue. 1, p. 63.

    Osorio, M. Zepeda, C. Nieves, J.C. and Cortes, U. 2005. Sixth Mexican International Conference on Computer Science (ENC'05). p. 198.

    Zepeda, C. Osorio, M. and Sol, D. 2005. 15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05). p. 292.

  • Theory and Practice of Logic Programming, Volume 4, Issue 3
  • May 2004, pp. 325-354

Applications of intuitionistic logic in Answer Set Programming

  • DOI:
  • Published online: 01 May 2004

We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given. Some equivalence notions and their applications are discussed. Some results on intermediate logics are shown, and applied later to prove properties of answer sets. A characterization of answer sets for logic programs with nested expressions is provided in terms of intuitionistic provability, generalizing a recent result given by Pearce. It is known that the answer set semantics for logic programs with nested expressions may select non-minimal models. Minimal models can be very important in some applications, therefore we studied them; in particular we obtain a characterization, in terms of intuitionistic logic, of answer sets which are also minimal models. We show that the logic G3 characterizes the notion of strong equivalence between programs under the semantic induced by these models. Finally we discuss possible applications and consequences of our results. They clearly state interesting links between ASP and intermediate logics, which might bring research in these two areas together.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *