ListarGI-IRlab-Artigos por tema "Answer set programming"
Mostrando ítems 1-6 de 6
-
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 ... -
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 ... -
Metric dynamic equilibrium logic
(Taylor and Francis Ltd., 2023)[Abstract]: In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behaviour of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it ... -
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 ... -
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 ...