Possibilistic Local Structure for Compiling Min-Based Networks

Raouia Ayachi; Nahla Ben Amor; Salem Benferhat

doi:10.1007/978-3-642-33042-1_51

ScienceGate Book Chapters

BOOK-CHAPTER

Possibilistic Local Structure for Compiling Min-Based Networks

Raouia Ayachi Nahla Ben Amor Salem Benferhat

Year: 2012 Advances in intelligent systems and computing Pages: 479-487 Publisher: Springer Nature

DOI: 10.1007/978-3-642-33042-1_51

Get Full-Text PDF Get Analytical Report

Keywords:

Inference Computer science Probabilistic logic Encoding (memory) Theoretical computer science Idempotence Property (philosophy) Binary number Bayesian network Operator (biology) Graphical model Artificial intelligence Mathematics Discrete mathematics Arithmetic

Metrics

Cited By

1.25

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Bayesian Modeling and Causal Inference

Physical Sciences → Computer Science → Artificial Intelligence

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

Rough Sets and Fuzzy Logic

Physical Sciences → Computer Science → Computational Theory and Mathematics

Possibilistic Local Structure for Compiling Min-Based Networks

Metrics

Citation History

Topics

Related Documents

Compiling Min-based Possibilistic Causal Networks: A Mutilated-Based Approach

Compiling Bayesian networks with local structure

An Approximate Algorithm for Min-Based Possibilistic Networks

Compiling Possibilistic Networks to Compute Learning Indicators

Computing optimal optimistic decisions using min-based possibilistic networks