Revisiting Explicit Negation in Answer Set Programming
Open Access
- 20 September 2019
- journal article
- conference paper
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (5-6) , 908-924
Abstract
A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front of atoms, rather than allowing its use as a regular operator. In this paper we consider the arbitrary combination of explicit negation with nested expressions, as those defined by Lifschitz, Tang and Turner. We extend the concept of reduct for this new syntax and then prove that it can be captured by an extension of Equilibrium Logic with this second negation. We study some properties of this variant and compare to the already known combination of Equilibrium Logic with Nelson’s strong negation.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Temporal equilibrium logic: a surveyJournal of Applied Non-Classical Logics, 2013
- Functional answer set programmingTheory and Practice of Logic Programming, 2011
- Strong Negation in Well-Founded and Partial Stable Semantics for Logic ProgramsLecture Notes in Computer Science, 2006
- Answer Sets for Propositional Theories2005
- Strongly equivalent logic programsACM Transactions on Computational Logic, 2001
- Stable Models and an Alternative Logic Programming Paradigm1999
- A new logical characterisation of stable models and answer sets1997
- Representing action and change by logic programsThe Journal of Logic Programming, 1993
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Notes on N-lattices and constructive logic with strong negationStudia Logica, 1977