Hybrid possibilistic networks

DOI10.1016/J.IJAR.2006.07.012zbMath1116.68094OpenAlexW2021475457MaRDI QIDQ881797

Salma Smaoui, Salem Benferhat

Publication date: 18 May 2007

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2006.07.012

zbMATH Keywords

possibility theorypossibilistic logicpossibilistic networks

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (8)

DAG representation of asymmetric independence models arising in coherent conditional possibility theory ⋮ Evaluating interval-valued influence diagrams ⋮ Evaluating Product-Based Possibilistic Networks Learning Algorithms ⋮ Variable Elimination for Interval-Valued Influence Diagrams ⋮ Lukasiewicz-based merging possibilistic networks ⋮ Efficient processing of twig query with compound predicates in fuzzy XML ⋮ Binary naive possibilistic classifiers: Handling uncertain inputs ⋮ Dealing with external actions in belief causal networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compiling propositional weighted bases
• Conditional possibilities independence and noninteraction
• The concept of a linguistic variable and its application to approximate reasoning. III
• Independence concepts in possibility theory. I
• On the transformation between possibilistic logic bases and possibilistic causal networks
• Independence and possibilistic conditioning
• A comparative study of possibilistic conditional independence and lack of interaction
• POSSIBILITY THEORY III: POSSIBILISTIC INDEPENDENCE
• Embedding Logics in the Local Computation Framework
• GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS

This page was built for publication: Hybrid possibilistic networks