default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNahla Ben Amor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Walid Fathallah
, Nahla Ben Amor, Philippe Leray:
Approximate inference on optimized quantum Bayesian networks. Int. J. Approx. Reason. 175: 109307 (2024)- 2023
- [c86]Walid Fathallah, Nahla Ben Amor, Philippe Leray:
An Optimized Quantum Circuit Representation of Bayesian Networks. ECSQARU 2023: 160-171 - [c85]Sabrine Ben Abdrabbah, Nahla Ben Amor, Raouia Ayachi:
A New Dynamic Community-Based Recommender System. ICAART (2) 2023: 125-136 - [c84]Sabrine Ben Abdrabbah, Sabrine Mallek, Nahla Ben Amor:
Dynamic Communities: A Novel Recommendation Approach for Individuals and Groups. ICAART (Revised Selected Paper) 2023: 187-201 - 2022
- [j28]Manel Ayadi, Nahla Ben Amor, Jérôme Lang:
Approximating voting rules from truncated ballots. Auton. Agents Multi Agent Syst. 36(1): 24 (2022) - [j27]Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi:
Solving possibilistic games with incomplete information. Int. J. Approx. Reason. 143: 139-158 (2022) - [c83]Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi:
Possibilistic Preference Networks and Lexicographic Preference Trees - A Comparison. IPMU (1) 2022: 581-592 - 2021
- [c82]Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi:
Conditional Preference Networks - Refining Solution Orderings Beyond Pareto Dominance. IEA/AIE (1) 2021: 447-459 - 2020
- [c81]Manel Ayadi, Nahla Ben Amor, Jérôme Lang:
Approximating Voting Rules from Truncated Ballots. EUMAS/AT 2020: 279-298 - [c80]Arij Azzabi, Nahla Ben Amor, Hélène Fargier, Régis Sabbadin:
Computing All Equilibria in Ordinal Graphical Games. ICTAI 2020: 1004-1011 - [c79]Arij Azzabi, Nahla Ben Amor, Hélène Fargier, Régis Sabbadin:
Ordinal Graph-Based Games. IPMU (1) 2020: 271-285 - [c78]Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi:
Ordinal Polymatrix Games with Incomplete Information. KR 2020: 99-108 - [c77]Mariem Briki, Sabrine Ben Abdrabbah, Nahla Ben Amor:
Highlighting the user's primary criterion in text mining-based recommendation system. OCTA 2020: 1-9 - [c76]Rihab Bouslama, Jaume Jordán, Stella Heras, Nahla Ben Amor:
Strategies in Case-Based Argumentation-Based Negotiation: An Application for the Tourism Domain. PAAMS (Workshops) 2020: 205-217 - [i4]Manel Ayadi, Nahla Ben Amor, Jérôme Lang:
Approximating Voting Rules from Truncated Ballots. CoRR abs/2002.06009 (2020)
2010 – 2019
- 2019
- [j26]Zied Elouedi, Nahla Ben Amor:
Special issue: Selected papers from Fuzzy Logic and Applications (LFA 2016). Fuzzy Sets Syst. 366: 1-2 (2019) - [j25]Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin:
Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes. Fuzzy Sets Syst. 366: 85-109 (2019) - [j24]Nahla Ben Amor, Fatma Essghaier, Hélène Fargier:
Solving sequential collective decision problems under qualitative uncertainty. Int. J. Approx. Reason. 109: 1-18 (2019) - [c75]Manel Ayadi, Nahla Ben Amor, Jérôme Lang, Dominik Peters:
Single Transferable Vote: Incomplete Knowledge and Communication Issues. AAMAS 2019: 1288-1296 - [c74]Rihab Bouslama, Raouia Ayachi, Nahla Ben Amor:
A New Generic Framework for Mediated Multilateral Argumentation-Based Negotiation Using Case-Based Reasoning. ECSQARU 2019: 14-26 - [c73]Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi:
Revisiting Conditional Preferences: From Defaults to Graphical Representations. ECSQARU 2019: 187-198 - [c72]Eya Chtouka, Wided Guezguez, Nahla Ben Amor:
Reinforcement Learning for New Adaptive Gamified LMS. ICDEc 2019: 305-314 - [c71]Nahla Ben Amor, Hélène Fargier, Régis Sabbadin, Meriem Trabelsi:
Possibilistic Games with Incomplete Information. IJCAI 2019: 1544-1550 - [c70]Rihab Bouslama, Raouia Ayachi, Nahla Ben Amor:
Using Convolutional Neural Network in Cross-Domain Argumentation Mining Framework. SUM 2019: 355-367 - [e1]Nahla Ben Amor, Benjamin Quost, Martin Theobald:
Scalable Uncertainty Management - 13th International Conference, SUM 2019, Compiègne, France, December 16-18, 2019, Proceedings. Lecture Notes in Computer Science 11940, Springer 2019, ISBN 978-3-030-35513-5 [contents] - 2018
- [j23]Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin:
Lexicographic refinements in stationary possibilistic Markov Decision Processes. Int. J. Approx. Reason. 103: 343-363 (2018) - [j22]Raouia Ayachi, Hamdi Bouhani, Nahla Ben Amor:
An Evolutionary Approach for Learning Opponent's Deadline and Reserve Points in Multi-Issue Negotiation. Int. J. Interact. Multim. Artif. Intell. 5(3): 131-140 (2018) - [j21]Sleh El Fidha, Nahla Ben Amor:
On the Use of Linear Combination in PWCP-Nets. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 26(1): 1-26 (2018) - [j20]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Possibilistic preference networks. Inf. Sci. 460-461: 401-415 (2018) - [j19]Bahri Oumayma, El-Ghazali Talbi, Nahla Ben Amor:
A generic fuzzy approach for multi-objective optimization under uncertainty. Swarm Evol. Comput. 40: 166-183 (2018) - [c69]Rihab Bouslama, Raouia Ayachi, Nahla Ben Amor:
A New Generic Framework for Argumentation-Based Negotiation Using Case-Based Reasoning. IPMU (2) 2018: 633-644 - [c68]Manel Ayadi, Nahla Ben Amor, Jérôme Lang:
The Communication Burden of Single Transferable Vote, in Practice. SAGT 2018: 251-255 - [c67]Nahla Ben Amor, Didier Dubois, Henri Prade, Syrine Saidi:
Representation of Multiple Agent Preferences - A Short Survey. SUM 2018: 359-367 - 2017
- [c66]Nahla Ben Amor, Fatma Essghaier, Hélène Fargier:
Algorithms for Multi-criteria Optimization in Possibilistic Decision Trees. ECSQARU 2017: 295-305 - [c65]Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin:
Efficient Policies for Stationary Possibilistic Markov Decision Processes. ECSQARU 2017: 306-317 - [c64]Maroua Haddad, Philippe Leray, Nahla Ben Amor:
Possibilistic MDL: A New Possibilistic Likelihood Based Score Function for Imprecise Data. ECSQARU 2017: 435-445 - [c63]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Graphical Representations of Multiple Agent Preferences. IEA/AIE (2) 2017: 142-153 - [c62]Sabrine Ben Abdrabbah, Manel Ayadi, Raouia Ayachi, Nahla Ben Amor:
Aggregating Top-K Lists in Group Recommendation Using Borda Rule. IEA/AIE (1) 2017: 325-334 - [c61]Sabrine Ben Abdrabbah, Raouia Ayachi, Nahla Ben Amor:
Social Activities Recommendation System for Students in Smart Campus. IIMSS 2017: 461-470 - [c60]Nahla Ben Amor, Hélène Fargier, Régis Sabbadin:
Equilibria in Ordinal Games: A Framework based on Possibility Theory. IJCAI 2017: 105-111 - [c59]Sleh El Fidha, Malek Mouhoub, Nahla Ben Amor, Eisa Alanazi:
Representing and reasoning with constrained PCP-nets. SMC 2017: 1007-1012 - [c58]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Expressivity of Possibilistic Preference Networks with Constraints. SUM 2017: 163-177 - 2016
- [j18]Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor:
Probabilistic relational model benchmark generation: Principle and application. Intell. Data Anal. 20(3): 615-635 (2016) - [j17]Raouia Ayachi, Imen Boukhris, Sehl Mellouli, Nahla Ben Amor, Zied Elouedi:
Proactive and reactive e-government services recommendation. Univers. Access Inf. Soc. 15(4): 681-697 (2016) - [c57]Nahla Ben Amor, Zeineb El Khalfi, Hélène Fargier, Régis Sabbadin:
Lexicographic Refinements in Possibilistic Decision Trees. ECAI 2016: 202-208 - [c56]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Preference Modeling with Possibilistic Networks and Symbolic Weights: A Theoretical Study. ECAI 2016: 1203-1211 - [c55]Sabrine Ben Abdrabbah, Raouia Ayachi, Nahla Ben Amor:
A Dynamic Community-Based Personalization for e-Government Services. ICEGOV 2016: 258-265 - [c54]Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor:
A Hybrid Approach for Probabilistic Relational Models Structure Learning. IDA 2016: 38-49 - [c53]Bahri Oumayma, Nahla Ben Amor, El-Ghazali Talbi:
β-Robustness Approach for Fuzzy Multi-objective Problems. IPMU (2) 2016: 225-237 - [c52]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Graphical Models for Preference Representation: An Overview. SUM 2016: 96-111 - [i3]Maroua Haddad, Philippe Leray, Nahla Ben Amor:
Possibilistic Networks: Parameters Learning from Imprecise Data and Evaluation strategy. CoRR abs/1607.03705 (2016) - 2015
- [j16]Montassar Ben Messaoud, Philippe Leray, Nahla Ben Amor:
SemCaDo: A serendipitous strategy for causal discovery and ontology evolution. Knowl. Based Syst. 76: 79-95 (2015) - [j15]Maroua Haddad, Philippe Leray, Nahla Ben Amor:
Apprentissage des réseaux possibilistes à partir de données. Rev. d'Intelligence Artif. 29(2): 229-252 (2015) - [j14]Nahla Ben Amor, Fatma Essghaier, Hélène Fargier:
Décision collective sous incertitude possibiliste. Principes et axiomatisation. Rev. d'Intelligence Artif. 29(5): 515-542 (2015) - [c51]Nahla Ben Amor, Fatma Essghaier, Hélène Fargier:
Egalitarian Collective Decision Making under Qualitative Possibilistic Uncertainty: Principles and Characterization. AAAI 2015: 3482-3488 - [c50]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Possibilistic Conditional Preference Networks. ECSQARU 2015: 36-46 - [c49]Maroua Haddad, Philippe Leray, Nahla Ben Amor:
Evaluating Product-Based Possibilistic Networks Learning Algorithms. ECSQARU 2015: 312-321 - [c48]Maroua Haddad, Philippe Leray, Nahla Ben Amor:
Learning possibilistic networks from data: a survey. IFSA-EUSFLAT 2015 - [c47]Manel Ayadi, Nahla Ben Amor:
Multi-round Vote Elicitation for Manipulation under Candidate Uncertainty. ICTAI 2015: 760-767 - [c46]Marwa Ben Aissia, Ahmed Badreddine, Nahla Ben Amor:
Uncertainty Management in Multi-leveled Risk Assessment: Context of IMS-QSE. IEA/AIE 2015: 3-12 - [c45]Sleh El Fidha, Nahla Ben Amor:
Probabilistic Weighted CP-nets. KES-IDT 2015: 159-169 - 2014
- [j13]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
Inference using compiled min-based possibilistic causal networks in the presence of interventions. Fuzzy Sets Syst. 239: 104-136 (2014) - [j12]Nahla Ben Amor, Hélène Fargier, Wided Guezguez:
Possibilistic sequential decision making. Int. J. Approx. Reason. 55(5): 1269-1300 (2014) - [j11]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
A generic framework for a compilation-based inference in probabilistic and possibilistic networks. Inf. Sci. 257: 342-356 (2014) - [c44]Bahri Oumayma, Nahla Ben Amor, El-Ghazali Talbi:
Optimization algorithms for multi-objective problems with fuzzy data. MCDM 2014: 194-201 - [c43]Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor:
Random Generation and Population of Probabilistic Relational Models and Databases. ICTAI 2014: 756-763 - [c42]Ahmed Badreddine, Mohamed Aymen Ben HajKacem, Nahla Ben Amor:
A Three Stages to Implement Barriers in Bayesian-Based Bow Tie Diagram. IEA/AIE (2) 2014: 32-41 - [c41]Bahri Oumayma, Nahla Ben Amor, El-Ghazali Talbi:
New Pareto Approach for Ranking Triangular Fuzzy Numbers. IPMU (2) 2014: 264-273 - [c40]Nahla Ben Amor, Fatma Essghaier, Hélène Fargier:
Solving Multi-criteria Decision Problems under Possibilistic Uncertainty Using Optimistic and Pessimistic Utilities. IPMU (3) 2014: 269-279 - [c39]Sabrine Ben Abdrabbah, Raouia Ayachi, Nahla Ben Amor:
Collaborative Filtering based on Dynamic Community Detection. DyNaK 2014 - [c38]Sleh El Fidha, Nahla Ben Amor:
Multi-agent conditional preference networks with incomplete and different structure. SoCPaR 2014: 197-202 - [c37]Hind Elouedi, Walid Meliani, Zied Elouedi, Nahla Ben Amor:
A hybrid approach based on decision trees and clustering for breast cancer classification. SoCPaR 2014: 226-231 - [c36]Nahla Ben Amor, Didier Dubois, Héla Gouider, Henri Prade:
Possibilistic Networks: A New Setting for Modeling Preferences. SUM 2014: 1-7 - 2013
- [c35]Ahmed Abdellatif, Nahla Ben Amor, Sehl Mellouli:
An intelligent framework for e-government personalized services. DG.O 2013: 120-126 - [c34]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
A Comparative Study of Compilation-Based Inference Methods for Min-Based Possibilistic Networks. ECSQARU 2013: 25-36 - [c33]Montassar Ben Messaoud, Philippe Leray, Nahla Ben Amor:
Active learning of causal Bayesian networks using ontologies: A case study. IJCNN 2013: 1-8 - [c32]Bahri Oumayma, Nahla Ben Amor, El-Ghazali Talbi:
A Possibilistic Framework for Solving Multi-objective Problems under Uncertainty: Definition of New Pareto Optimality. IPDPS Workshops 2013: 405-414 - [c31]Maroua Haddad, Nahla Ben Amor, Philippe Leray:
Imputation of Possibilistic Data for Structural Learning of Directed Acyclic Graphs. WILF 2013: 68-76 - [c30]Nahla Ben Amor:
Possibilistic Graphical Models: From Reasoning to Decision Making. WILF 2013: 86-99 - [c29]Yosra Ben Slimen, Raouia Ayachi, Nahla Ben Amor:
Probability-Possibility Transformation: - Application to Bayesian and Possibilistic Networks. WILF 2013: 122-130 - 2012
- [c28]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
Inference Using Compiled Product-Based Possibilistic Networks. IPMU (3) 2012: 470-480 - [c27]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
Possibilistic Local Structure for Compiling Min-Based Networks. SMPS 2012: 479-487 - [i2]Hélène Fargier, Nahla Ben Amor, Wided Guezguez:
On the Complexity of Decision Making in Possibilistic Decision Trees. CoRR abs/1202.3718 (2012) - [i1]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat, Rolf Haenni:
Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference. CoRR abs/1203.3465 (2012) - 2011
- [c26]Montassar Ben Messaoud, Philippe Leray, Nahla Ben Amor:
SemCaDo: A Serendipitous Strategy for Learning Causal Bayesian Networks Using Ontologies. ECSQARU 2011: 182-193 - [c25]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach. ECSQARU 2011: 700-712 - [c24]Mouna Ben Ishak, Philippe Leray, Nahla Ben Amor:
A Two-way Approach for Probabilistic Graphical Models Structure Learning and Ontology Enrichment. KEOD 2011: 189-194 - [c23]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
An Augmented-Based Approach for Compiling Min-based Possibilistic Causal Networks. ICTAI 2011: 675-678 - [c22]Hélène Fargier, Nahla Ben Amor, Wided Guezguez:
On the Complexity of Decision Making in Possibilistic Decision Trees. UAI 2011: 203-210 - [c21]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat:
Experimental Comparative Study of Compilation-Based Inference in Bayesian and Possibilitic Networks. WILF 2011: 155-163 - 2010
- [c20]Ahmed Badreddine, Nahla Ben Amor:
A dynamic barriers implementation in Bayesian-based bow tie diagrams for risk analysis. AICCSA 2010: 1-8 - [c19]Ahmed Badreddine, Nahla Ben Amor:
A New Approach to Construct Optimal Bow Tie Diagrams for Risk Analysis. IEA/AIE (2) 2010: 595-604 - [c18]Nahla Ben Amor, Hélène Fargier, Wided Guezguez:
Necessity-Based Choquet Integrals for Sequential Decision Making under Uncertainty. IPMU 2010: 521-531 - [c17]Raouia Ayachi, Nahla Ben Amor, Salem Benferhat, Rolf Haenni:
Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference. UAI 2010: 40-47
2000 – 2009
- 2009
- [j10]Wided Guezguez, Nahla Ben Amor, Khaled Mellouli:
Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities. Eur. J. Oper. Res. 195(1): 223-238 (2009) - [j9]Bakhta Haouari, Nahla Ben Amor, Zied Elouedi, Khaled Mellouli:
Naïve possibilistic network classifiers. Fuzzy Sets Syst. 160(22): 3224-3238 (2009) - [j8]Khaled Mellouli, Zied Elouedi, Nahla Ben Amor, Boutheina Ben Yaghlane:
Special Issue on the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2007). Int. J. Approx. Reason. 50(6): 823-824 (2009) - [c16]Montassar Ben Messaoud, Philippe Leray, Nahla Ben Amor:
Integrating Ontological Knowledge for Iterative Causal Discovery and Visualization. ECSQARU 2009: 168-179 - [c15]Raouia Ayachi, Nahla Ben Amor:
Brain Tumor Segmentation Using Support Vector Machines. ECSQARU 2009: 736-747 - [c14]Ahmed Badreddine, Taieb Ben Romdhane, Nahla Ben Amor:
A Multi-objective Approach to Implement an Integrated Management System: Quality, Security, Environment. SMC 2009: 4728-4733 - 2008
- [j7]Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi:
Decision trees as possibilistic classifiers. Int. J. Approx. Reason. 48(3): 784-807 (2008) - [j6]Hanen Borchani, Nahla Ben Amor, Fédia Khalfallah:
Learning and Evaluating Bayesian Network Equivalence Classes from Incomplete Data. Int. J. Pattern Recognit. Artif. Intell. 22(2): 253-278 (2008) - [c13]Ilyes Jenhani, Nahla Ben Amor, Salem Benferhat, Zied Elouedi:
SIM-PDT: A Similarity Based Possibilistic Decision Tree Approach. FoIKS 2008: 348-364 - 2007
- [j5]Nahla Ben Amor, Salem Benferhat, Khaled Mellouli, Salma Smaoui:
Inférence dans les réseaux possibilistes basés sur le conditionnement ordinal. Rev. d'Intelligence Artif. 21(4): 489-519 (2007) - [c12]Hanen Borchani, Maher Chaouachi, Nahla Ben Amor:
Learning Causal Bayesian Networks from Incomplete Observational Data and Interventions. ECSQARU 2007: 17-29 - [c11]Ilyes Jenhani, Nahla Ben Amor, Zied Elouedi, Salem Benferhat, Khaled Mellouli:
Information Affinity: A New Similarity Measure for Possibilistic Uncertain Information. ECSQARU 2007: 840-852 - 2006
- [j4]Nahla Ben Amor, Salem Benferhat, Zied Elouedi:
Réseaux bayésiens naïfs et arbres de décision dans les systèmes de détection d'intrusions. Tech. Sci. Informatiques 25(2): 167-196 (2006) - [c10]Hanen Borchani, Nahla Ben Amor, Khaled Mellouli:
Learning Bayesian Network Equivalence Classes from Incomplete Data. Discovery Science 2006: 291-295 - 2005
- [j3]Nahla Ben Amor, Salem Benferhat:
Graphoid Properties Of Qualitative Possibilistic Independence Relations. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 13(1): 59-96 (2005) - [c9]Nahla Ben Amor, Salem Benferhat, Zied Elouedi:
Towards a Definition of Evaluation Criteria for Probabilistic Classifiers. ECSQARU 2005: 921-931 - [c8]Ilyes Jenhani, Zied Elouedi, Nahla Ben Amor, Khaled Mellouli:
Qualitative Inference in Possibilistic Option Decision Trees. ECSQARU 2005: 944-955 - 2004
- [c7]Nahla Ben Amor, Salem Benferhat, Zied Elouedi:
Qualitative classification and evaluation in possibilistic decision trees. FUZZ-IEEE 2004: 653-657 - [c6]Nahla Ben Amor, Salem Benferhat, Zied Elouedi:
Naive Bayes vs decision trees in intrusion detection systems. SAC 2004: 420-424 - 2003
- [j2]Nahla Ben Amor, Salem Benferhat, Khaled Mellouli:
Anytime propagation algorithm for min-based possibilistic graphs. Soft Comput. 8(2): 150-161 (2003) - [c5]Yannick Le Moullec, Nahla Ben Amor, Jean-Philippe Diguet, Mohamed Abid, Jean Luc Philippe:
Multi-Granularity Metrics for the Era of Strongly Personalized SOCs. DATE 2003: 10674-10681 - [c4]Nahla Ben Amor, Salem Benferhat, Zied Elouedi, Khaled Mellouli:
Decision Trees and Qualitative Possibilistic Inference: Application to the Intrusion Detection Problem. ECSQARU 2003: 419-431 - 2002
- [j1]Nahla Ben Amor, Khaled Mellouli, Salem Benferhat, Didier Dubois, Henri Prade:
A Theoretical Framework for Possibilistic Independence in a Weakly Ordered Setting. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 10(2): 117-155 (2002) - [c3]Nahla Ben Amor, Salem Benferhat, Khaled Mellouli:
Anytime Possibilistic Propagation Algorithm. Soft-Ware 2002: 263-279 - 2001
- [c2]Nahla Ben Amor, Salem Benferhat, Khaled Mellouli:
A Two-Steps Algorithm for Min-Based Possibilistic Causal Networks. ECSQARU 2001: 266-277 - 2000
- [c1]Nahla Ben Amor, Salem Benferhat, Didier Dubois, Hector Geffner, Henri Prade:
Independence in qualitative uncertainty frameworks. KR 2000: 235-246
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:10 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:
