default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFahima Cheikh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j2]Anasse Chafik
, Fahima Cheikh Alili, Jean-François Condotta, Ivan Varzinczak:
Defeasible linear temporal logic. J. Appl. Non Class. Logics 33(1): 1-51 (2023)- [c11]Ryma Boumazouza, Fahima Cheikh Alili, Bertrand Mazure, Karim Tabia:
Symbolic Explanations for Multi-Label Classification. ICAART (3) 2023: 342-349 - 2022
- [i3]Ryma Boumazouza, Fahima Cheikh Alili, Bertrand Mazure, Karim Tabia:
A Symbolic Approach for Counterfactual Explanations. CoRR abs/2206.09638 (2022) - [i2]Ryma Boumazouza, Fahima Cheikh Alili, Bertrand Mazure, Karim Tabia:
A Model-Agnostic SAT-based Approach for Symbolic Explanation Enumeration. CoRR abs/2206.11539 (2022) - [i1]Ryma Boumazouza, Fahima Cheikh Alili, Bertrand Mazure, Karim Tabia:
ASTERYX : A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations. CoRR abs/2206.11900 (2022) - 2021
- [c10]Ryma Boumazouza, Fahima Cheikh Alili, Bertrand Mazure, Karim Tabia:
ASTERYX: A model-Agnostic SaT-basEd appRoach for sYmbolic and score-based eXplanations. CIKM 2021: 120-129 - [c9]Anasse Chafik, Fahima Cheikh Alili, Jean-François Condotta, Ivan Varzinczak:
A One-Pass Tree-Shaped Tableau for Defeasible LTL. TIME 2021: 16:1-16:18 - 2020
- [c8]Ryma Boumazouza, Fahima Cheikh Alili, Bertrand Mazure, Karim Tabia:
A Symbolic Approach for Counterfactual Explanations. SUM 2020: 270-277 - [c7]Anasse Chafik, Fahima Cheikh Alili, Jean-François Condotta, Ivan Varzinczak:
On the Decidability of a Fragment of preferential LTL. TIME 2020: 19:1-19:19
2000 – 2009
- 2009
- [b1]Fahima Cheikh Alili:
Composition de services: algorithmes et complexité. (Composition of services: algorithmes and complexity). Paul Sabatier University, Toulouse, France, 2009 - [c6]Philippe Balbiani, Fahima Cheikh Alili, Pierre-Cyrille Héam, Olga Kouchnarenko:
Composition of Services with Constraints. FACS@FMWeek 2009: 31-46 - [c5]Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade:
Controller/Orchestrator Synthesis via Filtration. M4M 2009: 33-48 - 2008
- [j1]Daniela Berardi, Fahima Cheikh, Giuseppe De Giacomo, Fabio Patrizi:
Automatic Service Composition via Simulation. Int. J. Found. Comput. Sci. 19(2): 429-451 (2008) - [c4]Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade:
Composition of Interactive Web Services Based on Controller Synthesis. SERVICES I 2008: 521-528 - [c3]Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade:
Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition. ICE@ICALP 2008: 3-18 - 2006
- [c2]Fahima Cheikh, Giuseppe De Giacomo, Massimo Mecella:
Automatic web services composition in trustaware communities. SWS 2006: 43-52 - 2005
- [c1]Philippe Balbiani, Fahima Cheikh:
Safety Problems in Access Control with Temporal Constraints. MMM-ACNS 2005: 165-178
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 2025-01-21 00:06 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:
