Syntactic ASP forgetting with forks
Use este enlace para citar
http://hdl.handle.net/2183/36290Colecciones
- GI-IRlab-Artigos [27]
Metadatos
Mostrar el registro completo del ítemTítulo
Syntactic ASP forgetting with forksAutor(es)
Fecha
2024-01Cita bibliográfica
F. Aguado, P. Cabalar, J. Fandiño, D. Pearce, G. Pérez, and C. Vidal, "Syntactic ASP forgetting with forks", Artificial Intelligence, Vol. 326, 104033, Jan. 2024, doi: 10.1016/j.artint.2023.104033
Resumen
[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 for a rigorous treatment of specifications, the correct construction of solvers and the extension with other representational features. In this paper, we present a syntactic transformation, called the unfolding operator, that allows forgetting an atom in a logic program (under ASP semantics). The main advantage of unfolding is that, unlike other syntactic operators, it is always applicable and guarantees strong persistence, that is, the result preserves the same stable models with respect to any context where the forgotten atom does not occur. The price for its completeness is that the result is an expression that may contain the fork operator. Yet, we illustrate how, in some cases, the application of fork properties may allow us to reduce the fork to a logic program.
Palabras clave
Answer set programming
Equilibrium logic
Forgetting; Forks
Strong equivalence
Strong persistence
Equilibrium logic
Forgetting; Forks
Strong equivalence
Strong persistence
Versión del editor
Derechos
Atribución 3.0 España