Buscar
Mostrando ítems 1-2 de 2
Revisiting Explicit Negation in Answer Set Programming
(Cambridge University Press, 2019-09)
[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 ...
Equilibrium graphs
(Springer, 2019)
[Abstract]: In this paper we present an extension of Peirce’s existential graphs to provide a diagrammatic representation of expressions in Quantified Equilibrium Logic (QEL). Using this formalisation, logical connectives ...