default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasood Feyzbakhsh Rankooh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Jussi Rintanen, Masood Feyzbakhsh Rankooh:
Symmetry-Breaking Constraints for Directed Graphs. ECAI 2024: 4248-4253- [c12]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming. IJCAI 2024: 3369-3376 - [c11]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract). IJCAI 2024: 8399-8404 - [i6]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Interpretable classifiers for tabular data via discretization and feature selection. CoRR abs/2402.05680 (2024) - [i5]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Globally Interpretable Classifiers via Boolean Formulas with Dynamic Propositions. CoRR abs/2406.01114 (2024) - 2023
- [j2]Masood Feyzbakhsh Rankooh
, Tomi Janhunen:
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs. Theory Pract. Log. Program. 23(4): 782-796 (2023) - [c10]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. JELIA 2023: 90-105 - [c9]Anssi Yli-Jyrä, Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling. PADL 2023: 279-294 - [i4]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs. CoRR abs/2306.05069 (2023) - [i3]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Short Boolean Formulas as Explanations in Practice. CoRR abs/2307.06971 (2023) - 2022
- [c8]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination. AAAI 2022: 5861-5868 - [c7]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Efficient Encoding of Cost Optimal Delete-Free Planning as SAT. AAAI 2022: 9910-9917 - [c6]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming. ICAPS 2022: 71-79 - [c5]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. HYDRA/RCRA@LPNMR 2022: 64-77 - [c4]Masood Feyzbakhsh Rankooh, Tomi Janhunen:
Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination. LPNMR 2022: 203-216 - [i2]Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander:
Explainability via Short Formulas: the Case of Propositional Logic with Implementation. CoRR abs/2209.01403 (2022) - 2021
- [i1]Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Propositional Encodings of Acyclicity and Reachability by using Vertex Elimination. CoRR abs/2105.12908 (2021)
2010 – 2019
- 2015
- [j1]Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani:
ITSAT: An Efficient SAT-Based Temporal Planner. J. Artif. Intell. Res. 53: 541-632 (2015) - 2013
- [c3]Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani:
New Encoding Methods for SAT-Based Temporal Planning. ICAPS 2013 - 2012
- [c2]Masood Feyzbakhsh Rankooh, Ali Mahjoob, Gholamreza Ghassem-Sani:
Using Satisfiability for Non-optimal Temporal Planning. JELIA 2012: 176-188 - 2011
- [c1]Masood Feyzbakhsh Rankooh, Gholamreza Ghassem-Sani:
A Complete State-Space Based Temporal Planner. ICTAI 2011: 297-304
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
