Masood Feyzbakhsh Rankooh

Orcid: 0000-0001-5660-3052

According to our database1, Masood Feyzbakhsh Rankooh authored at least 17 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions.
CoRR, 2024

Interpretable classifiers for tabular data via discretization and feature selection.
CoRR, 2024

Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract).
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Symmetry-Breaking Constraints for Directed Graphs.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs.
Theory Pract. Log. Program., July, 2023

Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling.
Proceedings of the Practical Aspects of Declarative Languages, 2023

Short Boolean Formulas as Explanations in Practice.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2022
Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

Explainability via Short Formulas: the Case of Propositional Logic with Implementation.
Proceedings of the Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning (HYDRA 2022) and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2022) co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), 2022

Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Efficient Encoding of Cost Optimal Delete-Free Planning as SAT.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2015
ITSAT: An Efficient SAT-Based Temporal Planner.
J. Artif. Intell. Res., 2015

2013
New Encoding Methods for SAT-Based Temporal Planning.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Using Satisfiability for Non-optimal Temporal Planning.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

2011
A Complete State-Space Based Temporal Planner.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011


  Loading...