Jorge Fandinno
3 papers in the PaperMetrix corpus
Papers by this author
-
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
2020 · arXiv (Cornell University)
It is well-know that deciding consistency for normal answer set programs (ASP) is NP-complete, thus, as hard as the satisfaction problem for classical propositional logic (SAT). The best algorithms to solve these problems take exponential …
-
Towards a Semantics for Hybrid ASP systems
2021 · arXiv (Cornell University)
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing …
-
On the Semantics of Hybrid ASP Systems Based on Clingo
2023 · Algorithms
Over the last decades, the development of Answer Set Programming (ASP) has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide …