Stem possibilist$ (all stems)
21 papers:
ICEIS-v1-2015-RezendeJ #concurrent #process #using #workflow- Deadlock Avoidance in Interorganizational Business Processes using a Possibilistic WorkFlow Net (LPdR, SJ), pp. 429–439.
ICEIS-v1-2014-RezendeJC #communication #problem #workflow- Possibilistic Interorganizational Workflow Net for the Recovery Problem Concerning Communication Failures (LPdR, SJ, JC), pp. 432–439.
KR-2014-BenferhatT #network #nondeterminism #reasoning- Reasoning with Uncertain Inputs in Possibilistic Networks (SB, KT).
KR-2012-DuboisPS #logic #modelling- Stable Models in Generalized Possibilistic Logic (DD, HP, SS).
ICLP-2012-NievesL #logic programming #source code- Possibilistic Nested Logic Programs (JCN, HL), pp. 267–276.
ICPR-2010-IsmailF #clustering #finite #modelling #robust- Possibilistic Clustering Based on Robust Modeling of Finite Generalized Dirichlet Mixture (MMBI, HF), pp. 573–576.
ICEIS-AIDSS-2008-AjroudOBY #algorithm #approximate #network- An Approximate Propagation Algorithm for Product-Based Possibilistic Networks (AA, MNO, SB, HY), pp. 321–326.
HCI-AS-2007-HeHDZM #analysis #bibliography #design #optimisation #reliability- A Review of Possibilistic Approaches to Reliability Analysis and Optimization in Engineering Design (LPH, HZH, LD, XDZ, QM), pp. 1075–1084.
KR-2006-Saint-CyrP #fuzzy #modelling #nondeterminism #persistent #reasoning- Possibilistic Handling of Uncertain Default Rules with Applications to Persistence Modeling and Fuzzy Default Reasoning (FDdSC, HP), pp. 440–451.
ICPR-v1-2004-TabboneW04b #adaptation #algorithm #image- Binarization of Color Images from an Adaptation of Possibilistic C-Means Algorithm (ST, LW), pp. 704–707.
KR-2004-AmgoudP #approach- Reaching Agreement Through Argumentation: A Possibilistic Approach (LA, HP), pp. 175–182.
KR-2004-BenferhatBN #analysis #reasoning- An Experimental Analysis of Possibilistic Default Reasoning (SB, JFB, RDSN), pp. 130–140.
KR-2004-MailheP #fuzzy #knowledge base- Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules (BM, HP), pp. 338–347.
KR-2004-QiLG #consistency #knowledge base- A Split-Combination Method for Merging Inconsistent Possibilistic Knowledge Bases (GQ, WL, DHG), pp. 348–356.
VMCAI-2003-BossiFPR #bisimulation #security #verification- Bisimulation and Unwinding for Verifying Possibilistic Security Properties (AB, RF, CP, SR), pp. 223–237.
KR-2002-BernferhatDKP #framework #logic #representation- Bipolar Representation and Fusion of Preferences on the Possibilistic Logic framework (SB, DD, SK, HP), pp. 421–448.
SAC-2002-BoscDP #database #query- About possibilistic queries against possibilistic databases (PB, LD, OP), pp. 807–811.
SAC-2001-BoscLP- A function-based join for the manipulation of possibilistic relations (PB, LL, OP), pp. 472–476.
KR-1992-BenferhatDP #logic #representation- Representing Default Rules in Possibilistic Logic (SB, DD, HP), pp. 673–684.
ICLP-1991-DuboisLP #logic programming #towards- Towards Possibilistic Logic Programming (DD, JL, HP), pp. 581–595.
VLDB-1989-RundensteinerB #database- Aggregates in Possibilistic Databases (EAR, LB), pp. 287–295.