1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.LO2023★ 1 cited
Generalizing Level Ranking Constraints for Monotone and Convex Aggregates
Tomi Janhunen
In answer set programming (ASP), answer sets capture solutions to search problems of interest and thus the efficient computation of answer sets is of utmost importance. One viable…
cs.AI2023
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs
Masood Feyzbakhsh Rankooh, Tomi Janhunen
We establish a novel relation between delete-free planning, an important task for the AI Planning community also known as relaxed planning, and logic programming. We show that give…
cs.AI2016
Stable-Unstable Semantics: Beyond NP with Normal Logic Programs
Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi
Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is…