Buscar
Mostrando ítems 1-5 de 5
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 ...
Linear-Time Temporal Answer Set Programming
(Cambridge University Press, 2023)
[Abstract]: In this survey, we present an overview on (Modal) Temporal Logic Programming in view of its application to Knowledge Representation and Declarative Problem Solving. The syntax of this extension of logic programs ...
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. ...
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 ...