Buscar
Mostrando ítems 1-5 de 5
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 ...
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 ...
Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs
(MDPI, 2022)
[Abstract] Answer Set Programming (ASP) is a well established logical approach in artificial intelligence that is widely used for knowledge representation and problem solving. Equilibrium logic extends answer set semantics ...
Forgetting Auxiliary Atoms in Forks
(Elsevier Ltd, 2019)
[Abstract]: In this work we tackle the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context. ...