Buscar
Mostrando ítems 1-4 de 4
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 ...
A Polynomial Reduction of Forks Into Logic Programs
(Elsevier, 2022)
[Abstract] In this research note we present additional results for an earlier published paper [1]. There, we studied the problem of projective strong equivalence (PSE) of logic programs, that is, checking whether two logic ...
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 ...
Syntactic ASP forgetting with forks
(Elsevier, 2024-01)
[Abstract]: Answer Set Programming (ASP) constitutes nowadays one of the most successful paradigms for practical Knowledge Representation and declarative problem solving. The formal analysis of ASP programs is essential ...