Showing cs.AIShow all
3 papers · 1 filter
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.AI2022
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-…
cs.AI2021
Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination
Masood Feyzbakhsh Rankooh, Jussi Rintanen
We introduce novel methods for encoding acyclicity and s-t-reachability constraints for propositional formulas with underlying directed graphs. They are based on vertex elimination…