53 citations · 154 across the 14 of their papers we have counts for
16 papers
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…
Short Boolean Formulas as Explanations in Practice
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minim…
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…
Explainability via Short Formulas: the Case of Propositional Logic with Implementation
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2
We conceptualize explainability in terms of logic and formula size, giving a number of related definitions of explainability in a very general setting. Our main interest is the so-…
Solution Enumeration by Optimality in Answer Set Programming
Jukka Pajunen, Tomi Janhunen
Given a combinatorial search problem, it may be highly useful to enumerate its (all) solutions besides just finding one solution, or showing that none exists. The same can be state…
Boosting Answer Set Optimization with Weighted Comparator Networks
Jori Bomanson, Tomi Janhunen
Answer set programming (ASP) is a paradigm for modeling knowledge intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess…