Masood Feyzbakhsh Rankooh

25 papers A* 8A 1B 4C 1Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2025 A* conf
Cost-Optimal Delete-Free Classical Planning via Maximum Satisfiability.
KR
Masood Feyzbakhsh Rankooh, Andreas Niskanen, Matti Järvisalo
2025 J jnl
Explainability via Short Formulas: the Case of Propositional Logic with Implementation.
J. Artif. Intell. Res.
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2025 A* conf
Reasoning in Assumption-Based Argumentation via SAT.
KR
Andreas Niskanen, Masood Feyzbakhsh Rankooh, Tuomo Lehtonen, Matti Järvisalo
2024 A* conf
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract).
IJCAI
Masood Feyzbakhsh Rankooh, Tomi Janhunen
2024 J jnl
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions.
CoRR
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2024 A* conf
Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming.
IJCAI
Masood Feyzbakhsh Rankooh, Tomi Janhunen
2024 — conf
Interpretable Classifiers for Tabular Data via Feature Selection and Discretization.
DAO-XAI@ECAI
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2024 J jnl
Interpretable classifiers for tabular data via discretization and feature selection.
CoRR
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2024 A conf
Symmetry-Breaking Constraints for Directed Graphs.
ECAI
Jussi Rintanen, Masood Feyzbakhsh Rankooh
2023 J jnl
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs.
CoRR
Masood Feyzbakhsh Rankooh, Tomi Janhunen
2023 J jnl
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs.
Theory Pract. Log. Program.
Masood Feyzbakhsh Rankooh, Tomi Janhunen
2023 C conf
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling.
PADL
Anssi Yli-Jyrä, Masood Feyzbakhsh Rankooh, Tomi Janhunen
2023 B conf
Short Boolean Formulas as Explanations in Practice.
JELIA
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2023 J jnl
Short Boolean Formulas as Explanations in Practice.
CoRR
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2022 A* conf
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming.
ICAPS
Masood Feyzbakhsh Rankooh, Jussi Rintanen
2022 B conf
Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination.
LPNMR
Masood Feyzbakhsh Rankooh, Tomi Janhunen
2022 A* conf
Efficient Encoding of Cost Optimal Delete-Free Planning as SAT.
AAAI
Masood Feyzbakhsh Rankooh, Jussi Rintanen
2022 — conf
Explainability via Short Formulas: the Case of Propositional Logic with Implementation.
HYDRA/RCRA@LPNMR
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2022 J jnl
Explainability via Short Formulas: the Case of Propositional Logic with Implementation.
CoRR
Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
2022 A* conf
Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination.
AAAI
Masood Feyzbakhsh Rankooh, Jussi Rintanen
2021 J jnl
Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination.
CoRR
Masood Feyzbakhsh Rankooh, Jussi Rintanen
2015 J jnl
ITSAT: An Efficient SAT-Based Temporal Planner.
J. Artif. Intell. Res.
Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani
2013 A* conf
New Encoding Methods for SAT-Based Temporal Planning.
ICAPS
Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani
2012 B conf
Using Satisfiability for Non-optimal Temporal Planning.
JELIA
Masood Feyzbakhsh Rankooh, Ali Mahjoob, Gholamreza Ghassem-Sani
2011 B conf
A Complete State-Space Based Temporal Planner.
ICTAI
Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani