default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCassio P. de Campos
Cassio Polpo de Campos – Cassio de Campos
Person information
- affiliation (since 2019): Eindhoven University of Technology, Department of Mathematics and Computer Science, The Netherlands
- affiliation (2017-2019): Utrecht University, Department of Information and Computing Sciences, The Netherlands
- affiliation (2014-2017): Queen's University Belfast, Centre for Data Science and Scalable Computing, UK
- affiliation (2008-2014): Dalle Molle Institute for Artificial Intelligence, Switzerland
2020 – today
- 2025
[c53]Soroush Ghandi, Benjamin Quost, Cassio de Campos:
Imposing Constraints in Probabilistic Circuits via Gradient Optimization. IDA 2025: 209-220- 2024
- [j36]Rafael Rodrigues Mendes Ribeiro
, Jordão Natal de Oliveira Júnior, Cassio Polpo de Campos, Carlos Dias Maciel:
Conditional probability table limit-based quantization for Bayesian networks: model quality, data fidelity and structure score. Appl. Intell. 54(6): 4668-4688 (2024) - [j35]Jasper De Bock, Gert De Cooman, Cassio P. de Campos:
Extended papers from the 11th International Symposium on Imprecise Probabilities: Theories and Applications. Int. J. Approx. Reason. 168: 109150 (2024) - [j34]David Ricardo Montalvan Hernandez, Tijn Centen, Thomas Krak, Erik Quaeghebeur, Cassio de Campos:
Beyond tree-shaped credal probabilistic circuits. Int. J. Approx. Reason. 171: 109047 (2024) - [c52]Gennaro Gala, Cassio P. de Campos, Robert Peharz, Antonio Vergari, Erik Quaeghebeur:
Probabilistic Integral Circuits. AISTATS 2024: 2143-2151 - [c51]David Ricardo Montalvan Hernandez, Thomas Krak, Cassio de Campos:
Dempster-Shafer Credal Probabilistic Circuits. BELIEF 2024: 31-39 - [c50]Gennaro Gala, Cassio P. de Campos, Antonio Vergari, Erik Quaeghebeur:
Scaling Continuous Latent Variable Models as Probabilistic Integral Circuits. NeurIPS 2024 - [c49]Soroush Ghandi, Benjamin Quost, Cassio de Campos:
Probabilistic Circuits with Constraints via Convex Optimization. ECML/PKDD (3) 2024: 161-177 - [i28]Soroush Ghandi, Benjamin Quost, Cassio de Campos:
Probabilistic Circuits with Constraints via Convex Optimization. CoRR abs/2403.13125 (2024) - [i27]Soroush Ghandi, Benjamin Quost, Cassio de Campos:
Soft Learning Probabilistic Circuits. CoRR abs/2403.14504 (2024) - [i26]Gennaro Gala, Cassio de Campos, Antonio Vergari, Erik Quaeghebeur:
Scaling Continuous Latent Variable Models as Probabilistic Integral Circuits. CoRR abs/2406.06494 (2024) - [i25]Wieger Wesselink, Bram Grooten, Qiao Xiao, Cassio de Campos, Mykola Pechenizkiy:
Nerva: a Truly Sparse Implementation of Neural Networks. CoRR abs/2407.17437 (2024) - [i24]Lorenzo Loconte, Antonio Mari, Gennaro Gala, Robert Peharz, Cassio de Campos, Erik Quaeghebeur, Gennaro Vessio, Antonio Vergari:
What is the Relationship between Tensor Factorizations and Circuits (and How Can We Exploit it)? CoRR abs/2409.07953 (2024) - 2023
- [c48]Alvaro H. C. Correia, Gennaro Gala, Erik Quaeghebeur, Cassio P. de Campos, Robert Peharz:
Continuous Mixtures of Tractable Probabilistic Models. AAAI 2023: 7244-7252 - [c47]David Ricardo Montalvan Hernandez, Cassio de Campos:
Portfolio Optimization via Credal Probabilistic Circuits. ICAIF 2023: 646-654 - [c46]Vu-Linh Nguyen, Yang Yang, Cassio de Campos:
Probabilistic Multi-Dimensional Classification. UAI 2023: 1522-1533 - [i23]Vu-Linh Nguyen, Yang Yang, Cassio de Campos:
Probabilistic Multi-Dimensional Classification. CoRR abs/2306.06517 (2023) - [i22]Gennaro Gala, Cassio P. de Campos, Robert Peharz, Antonio Vergari, Erik Quaeghebeur:
Probabilistic Integral Circuits. CoRR abs/2310.16986 (2023) - 2022
- [j33]Kevin O'Hare, Anna Jurek-Loughrey, Cassio P. de Campos:
High-Value Token-Blocking: Efficient Blocking Method for Record Linkage. ACM Trans. Knowl. Discov. Data 16(2): 24:1-24:17 (2022) - [i21]Alvaro H. C. Correia, Gennaro Gala, Erik Quaeghebeur, Cassio P. de Campos, Robert Peharz:
Continuous Mixtures of Tractable Probabilistic Models. CoRR abs/2209.10584 (2022) - 2021
- [j32]Denis Deratani Mauá, Cassio Polpo de Campos:
Special Issue on Robustness in Probabilistic Graphical Models. Int. J. Approx. Reason. 137: 113 (2021) - [c45]Alessio Benavoli, Cassio P. de Campos:
Bayesian Independence Test with Mixed-type Variables. DSAA 2021: 1-13 - [e3]Cassio P. de Campos, Marloes H. Maathuis, Erik Quaeghebeur:
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI 2021, Virtual Event, 27-30 July 2021. Proceedings of Machine Learning Research 161, AUAI Press 2021 [contents] - [i20]Alessio Benavoli, Cassio P. de Campos:
Bayesian Kernelised Test of (In)dependence with Mixed-type Variables. CoRR abs/2105.04001 (2021) - 2020
- [j31]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A structured view on weighted counting with relations to counting, quantum computation and applications. Inf. Comput. 275: 104627 (2020) - [c44]Alvaro Henrique Chaim Correia, James Cussens, Cassio P. de Campos:
On Pruning for Score-Based Bayesian Network Structure Learning. AISTATS 2020: 2709-2718 - [c43]Alvaro H. C. Correia, Robert Peharz, Cassio P. de Campos:
Joints in Random Forests. NeurIPS 2020 - [c42]Cassio P. de Campos:
Almost No News on the Complexity of MAP in Bayesian Networks. PGM 2020: 149-160 - [i19]Alvaro H. C. Correia, Robert Peharz, Cassio P. de Campos:
Joints in Random Forests. CoRR abs/2006.14937 (2020) - [i18]Alvaro H. C. Correia, Robert Peharz, Cassio P. de Campos:
Towards Robust Classification with Deep Generative Forests. CoRR abs/2007.05721 (2020)
2010 – 2019
- 2019
- [j30]Kevin O'Hare, Anna Jurek-Loughrey, Cassio P. de Campos:
An unsupervised blocking technique for more efficient record linkage. Data Knowl. Eng. 122: 181-195 (2019) - [j29]Diarmaid Conaty, Jesús Martínez del Rincón, Cassio P. de Campos:
A hierarchy of sum-product networks using robustness. Int. J. Approx. Reason. 113: 245-255 (2019) - [c41]Alvaro Henrique Chaim Correia, Cassio P. de Campos, Linda C. van der Gaag:
An Experimental Study of Prior Dependence in Bayesian Network Structure Learning. ISIPTA 2019: 78-81 - [c40]Rob Wit, Cassio P. de Campos, Diarmaid Conaty, Jesús Martínez del Rincón:
Robustness in Sum-Product Networks with Continuous and Categorical Data. ISIPTA 2019: 156-158 - [c39]Alvaro H. C. Correia, Cassio P. de Campos:
Towards Scalable and Robust Sum-Product Networks. SUM 2019: 409-422 - [e2]Jasper De Bock, Cassio P. de Campos, Gert de Cooman, Erik Quaeghebeur, Gregory R. Wheeler:
International Symposium on Imprecise Probabilities: Theories and Applications, ISIPTA 2019, 3-6 July 2019, Thagaste, Ghent, Belgium. Proceedings of Machine Learning Research 103, PMLR 2019 [contents] - [i17]Alvaro H. C. Correia, James Cussens, Cassio P. de Campos:
On Pruning for Score-Based Bayesian Network Structure Learning. CoRR abs/1905.09943 (2019) - 2018
- [j28]Cassio P. de Campos, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Entropy-based pruning for learning Bayesian networks using BIC. Artif. Intell. 260: 42-50 (2018) - [j27]Denis Deratani Mauá, Diarmaid Conaty, Fábio Gagliardi Cozman, Katja Poppenhaeger, Cassio Polpo de Campos:
Robustifying sum-product networks. Int. J. Approx. Reason. 101: 163-180 (2018) - [j26]Kevin O'Hare, Anna Jurek, Cassio P. de Campos:
A new technique of selecting an optimal blocking method for better record linkage. Inf. Syst. 77: 151-166 (2018) - [j25]Mauro Scanagatta, Giorgio Corani, Cassio Polpo de Campos, Marco Zaffalon:
Approximate structure learning for large Bayesian networks. Mach. Learn. 107(8-10): 1209-1227 (2018) - [c38]Diarmaid Conaty, Jesús Martínez del Rincón, Cassio P. de Campos:
Cascading Sum-Product Networks using Robustness. PGM 2018: 73-84 - 2017
- [j24]Siqi Nie, Cassio P. de Campos, Qiang Ji:
Efficient learning of Bayesian networks with bounded tree-width. Int. J. Approx. Reason. 80: 412-427 (2017) - [j23]Cassio P. de Campos, Paola M. V. Rancoita:
Introduction to the special issue on statistical and computational methods for genomics and integrative genomics. Int. J. Approx. Reason. 90: 272-273 (2017) - [j22]Cassio P. de Campos, Alessio Benavoli:
Joint Analysis of Multiple Algorithms and Performance Measures. New Gener. Comput. 35(1): 69-86 (2017) - [c37]Tameem Adel, Cassio P. de Campos:
Learning Bayesian Networks with Incomplete Data by Augmentation. AAAI 2017: 1684-1690 - [c36]Denis Deratani Mauá, Fábio Gagliardi Cozman, Diarmaid Conaty, Cassio P. de Campos:
Credal Sum-Product Networks. ISIPTA 2017: 205-216 - [c35]Diarmaid Conaty, Cassio P. de Campos, Denis Deratani Mauá:
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks. UAI 2017 - [i16]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A Structured View on Weighted Counting with Relations to Counting, Quantum Computation and Applications. CoRR abs/1701.06386 (2017) - [i15]Denis Deratani Mauá, Cassio P. de Campos:
Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks. CoRR abs/1703.06045 (2017) - [i14]Cassio P. de Campos, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon:
Entropy-based Pruning for Learning Bayesian Networks using BIC. CoRR abs/1707.06194 (2017) - 2016
- [j21]Paola M. V. Rancoita, Marco Zaffalon, Emanuele Zucca, Francesco Bertoni, Cassio P. de Campos:
Bayesian network data imputation with application to survival tree analysis. Comput. Stat. Data Anal. 93: 373-387 (2016) - [j20]Alessio Benavoli, Cassio P. de Campos:
Bayesian Dependence Tests for Continuous, Binary and Mixed Continuous-Binary Variables. Entropy 18(9): 326 (2016) - [j19]Cassio P. de Campos, Carlos Alberto De Bragança Pereira, Paola M. V. Rancoita, Adriano Polpo:
Ordering Quantiles through Confidence Statements. Entropy 18(10): 357 (2016) - [j18]Cassio P. de Campos, Giorgio Corani, Mauro Scanagatta, Marco Cuccu, Marco Zaffalon:
Learning extended tree augmented naive structures. Int. J. Approx. Reason. 68: 153-163 (2016) - [j17]Denis Deratani Mauá, Alessandro Antonucci, Cassio Polpo de Campos:
Hidden Markov models with set-valued parameters. Neurocomputing 180: 94-107 (2016) - [c34]Siqi Nie, Cassio P. de Campos, Qiang Ji:
Learning Bayesian Networks with Bounded Tree-width via Guided Search. AAAI 2016: 3294-3300 - [c33]Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon:
Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables. NIPS 2016: 1462-1470 - [e1]Alessandro Antonucci, Giorgio Corani, Cassio Polpo de Campos:
Probabilistic Graphical Models - Eighth International Conference, PGM 2016, Lugano, Switzerland, September 6-9, 2016. Proceedings. JMLR Workshop and Conference Proceedings 52, JMLR.org 2016 [contents] - [i13]Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon:
Learning Bounded Treewidth Bayesian Networks with Thousands of Variables. CoRR abs/1605.03392 (2016) - [i12]Tameem Adel, Cassio P. de Campos:
Learning Bayesian Networks without Assuming Missing at Random. CoRR abs/1608.07734 (2016) - 2015
- [j16]Cassio P. de Campos, Alessandro Antonucci:
Imprecision in Machine Learning and AI. IEEE Intell. Informatics Bull. 16(1): 20-23 (2015) - [j15]Aaron Meehan, Cassio P. de Campos:
Averaged Extended Tree Augmented Naive Classifier. Entropy 17(7): 5085-5100 (2015) - [j14]Alessandro Antonucci, Cassio P. de Campos, David Huber, Marco Zaffalon:
Approximate credal network updating by linear programming with applications to decision making. Int. J. Approx. Reason. 58: 25-38 (2015) - [c32]Siqi Nie, Cassio P. de Campos, Qiang Ji:
Learning Bounded Tree-Width Bayesian Networks via Sampling. ECSQARU 2015: 387-396 - [c31]Denis Deratani Mauá, Cassio P. de Campos, Fábio Gagliardi Cozman:
The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages. IJCAI 2015: 889-895 - [c30]Alessio Benavoli, Cassio P. de Campos:
Statistical Tests for Joint Analysis of Performance Measures. AMBN@JSAI-isAI 2015: 76-92 - [c29]Mauro Scanagatta, Cassio P. de Campos, Giorgio Corani, Marco Zaffalon:
Learning Bayesian Networks with Thousands of Variables. NIPS 2015: 1864-1872 - 2014
- [j13]Adriano Polpo, Cassio P. de Campos, Debajyoti Sinha, Stuart R. Lipsitz, Jianhang Lin:
Transform both sides model: A parametric approach. Comput. Stat. Data Anal. 71: 903-913 (2014) - [j12]Fábio Gagliardi Cozman, Cassio Polpo de Campos:
Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms. Int. J. Approx. Reason. 55(2): 666-682 (2014) - [j11]Denis Deratani Mauá, Cassio P. de Campos, Alessio Benavoli, Alessandro Antonucci:
Probabilistic Inference in Credal Networks: New Complexity Results. J. Artif. Intell. Res. 50: 603-637 (2014) - [c28]Denis Deratani Mauá, Cassio Polpo de Campos, Alessandro Antonucci:
Algorithms for Hidden Markov Models with Imprecisely Specified Parameters. BRACIS 2014: 186-191 - [c27]Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland:
The Computational Complexity of Stochastic Optimization. ISCO 2014: 173-185 - [c26]Siqi Nie, Denis Deratani Mauá, Cassio P. de Campos, Qiang Ji:
Advances in Learning Bayesian Networks of Bounded Treewidth. NIPS 2014: 2285-2293 - [c25]Jasper De Bock, Cassio P. de Campos, Alessandro Antonucci:
Global Sensitivity Analysis for MAP Inference in Graphical Models. NIPS 2014: 2690-2698 - [c24]Cassio P. de Campos, Marco Cuccu, Giorgio Corani, Marco Zaffalon:
Extended Tree Augmented Naive Classifier. Probabilistic Graphical Models 2014: 176-189 - [c23]Mauro Scanagatta, Cassio P. de Campos, Marco Zaffalon:
Min-BDeu and Max-BDeu Scores for Learning Bayesian Networks. Probabilistic Graphical Models 2014: 426-441 - [i11]Siqi Nie, Denis Deratani Mauá, Cassio Polpo de Campos, Qiang Ji:
Advances in Learning Bayesian Networks of Bounded Treewidth. CoRR abs/1406.1411 (2014) - 2013
- [j10]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables. Artif. Intell. 205: 30-38 (2013) - [c22]Cassio Polpo de Campos, Fábio Gagliardi Cozman:
Complexity of Inferences in Polytree-shaped Semi-Qualitative Probabilistic Networks. AAAI 2013: 217-223 - [c21]Alessandro Antonucci, Cassio P. de Campos, David Huber, Marco Zaffalon:
Approximating Credal Network Inferences by Linear Programming. ECSQARU 2013: 13-24 - [c20]Denis Deratani Mauá, Cassio Polpo de Campos, Alessio Benavoli, Alessandro Antonucci:
On the Complexity of Strong and Epistemic Credal Networks. UAI 2013 - [i10]Denis Deratani Mauá, Cassio Polpo de Campos, Alessio Benavoli, Alessandro Antonucci:
On the Complexity of Strong and Epistemic Credal Networks. CoRR abs/1309.6845 (2013) - [i9]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A Structured View on Weighted Counting with Relations to Quantum Computation and Applications. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j9]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Updating credal networks is approximable in polynomial time. Int. J. Approx. Reason. 53(8): 1183-1199 (2012) - [j8]Denis Deratani Mauá, Cassio P. de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. J. Artif. Intell. Res. 44: 97-140 (2012) - [c19]Denis Deratani Mauá, Cassio Polpo de Campos:
Anytime Marginal MAP Inference. ICML 2012 - [c18]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. UAI 2012: 604-613 - [i8]Cassio Polpo de Campos, Qiang Ji:
Strategy Selection in Influence Diagrams using Imprecise Probabilities. CoRR abs/1206.3246 (2012) - [i7]Cassio Polpo de Campos, Fábio Gagliardi Cozman:
Belief Updating and Learning in Semi-Qualitative Probabilistic Networks. CoRR abs/1207.1367 (2012) - [i6]Fábio Gagliardi Cozman, Cassio Polpo de Campos, Jaime Shinsuke Ide, José Carlos Ferreira da Rocha:
Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitative Probabilistic Assesments. CoRR abs/1207.4121 (2012) - [i5]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
The Complexity of Approximately Solving Influence Diagrams. CoRR abs/1210.4890 (2012) - [i4]José Carlos Ferreira da Rocha, Fábio Gagliardi Cozman, Cassio Polpo de Campos:
Inference in Polytrees with Sets of Probabilities. CoRR abs/1212.2458 (2012) - 2011
- [j7]Cassio P. de Campos, Qiang Ji:
Efficient Structure Learning of Bayesian Networks using Constraints. J. Mach. Learn. Res. 12: 663-689 (2011) - [j6]José Carlos Ferreira da Rocha, Alaine Margarete Guimarães, Cassio Polpo de Campos:
Integração de evidências em redes credais e a regra de Jeffrey. RITA 18(2): 251-265 (2011) - [c17]Cassio P. de Campos, Qiang Ji:
Bayesian Networks and the Imprecise Dirichlet Model Applied to Recognition Problems. ECSQARU 2011: 158-169 - [c16]Cassio P. de Campos:
New Complexity Results for MAP in Bayesian Networks. IJCAI 2011: 2100-2106 - [c15]Cassio P. de Campos, Alessio Benavoli:
Inference with Multinomial Data: Why to Weaken the Prior Strength. IJCAI 2011: 2107-2112 - [c14]Denis Deratani Mauá, Cassio Polpo de Campos:
Solving Decision Problems with Limited Information. NIPS 2011: 603-611 - [i3]Denis Deratani Mauá, Cassio Polpo de Campos, Marco Zaffalon:
Solving Limited Memory Influence Diagrams. CoRR abs/1109.1754 (2011) - [i2]Giorgio Corani, Cassio P. de Campos:
Improving parameter learning of Bayesian nets from incomplete data. CoRR abs/1110.3239 (2011) - 2010
- [j5]Alessandro Antonucci, Yi Sun, Cassio P. de Campos, Marco Zaffalon:
Generalized loopy 2U: A new algorithm for approximate inference in credal networks. Int. J. Approx. Reason. 51(5): 474-484 (2010) - [j4]Giorgio Corani, Cassio P. de Campos:
A tree augmented classifier based on Extreme Imprecise Dirichlet Model. Int. J. Approx. Reason. 51(9): 1053-1068 (2010) - [c13]Cassio P. de Campos, Qiang Ji:
Properties of Bayesian Dirichlet Scores to Learn Bayesian Network Structures. AAAI 2010: 431-436 - [c12]Cassio P. de Campos, Zhi Zeng, Qiang Ji:
An Improved Structural EM to Learn Dynamic Bayesian Nets. ICPR 2010: 601-604 - [i1]Cassio P. de Campos:
New Results for the MAP Problem in Bayesian Networks. CoRR abs/1007.3884 (2010)
2000 – 2009
- 2009
- [j3]Cassio Polpo de Campos, Fábio Gagliardi Cozman, José Eduardo Ochoa Luna:
Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence. J. Appl. Log. 7(2): 137-154 (2009) - [c11]Alessio Benavoli, Cassio P. de Campos:
Inference from Multinomial Data Based on a MLE-Dominance Criterion. ECSQARU 2009: 22-33 - [c10]Cassio P. de Campos, Zhi Zeng, Qiang Ji:
Structure learning of Bayesian networks using constraints. ICML 2009: 113-120 - 2008
- [j2]Fábio Gagliardi Cozman, Cassio Polpo de Campos, José Carlos Ferreira da Rocha:
Probabilistic logic with independence. Int. J. Approx. Reason. 49(1): 3-17 (2008) - [c9]Cassio P. de Campos, Yan Tong, Qiang Ji:
Constrained Maximum Likelihood Learning of Bayesian Networks for Facial Action Recognition. ECCV (3) 2008: 168-181 - [c8]Cassio P. de Campos, Qiang Ji:
Improving Bayesian Network parameter learning using constraints. ICPR 2008: 1-4 - [c7]Cassio P. de Campos, Qiang Ji:
Strategy Selection in Influence Diagrams using Imprecise Probabilities. UAI 2008: 121-128 - 2007
- [j1]Cassio Polpo de Campos, Fábio Gagliardi Cozman:
Computing lower and upper expectations under epistemic independence. Int. J. Approx. Reason. 44(3): 244-260 (2007) - 2006
- [c6]Fábio Gagliardi Cozman, Cassio P. de Campos, José Carlos Ferreira da Rocha:
Probabilistic Logic with Strong Independence. IBERAMIA-SBIA 2006: 612-621 - 2005
- [c5]Cassio Polpo de Campos, Fábio Gagliardi Cozman:
The Inferential Complexity of Bayesian and Credal Networks. IJCAI 2005: 1313-1318 - [c4]Cassio Polpo de Campos, Fábio Gagliardi Cozman:
Computing Lower and Upper Expectations under Epistemic Independence. ISIPTA 2005: 78-87 - [c3]Cassio Polpo de Campos, Fábio Gagliardi Cozman:
Belief Updating and Learning in Semi-Qualitative Probabilistic Networks. UAI 2005: 153-160 - 2004
- [c2]Fábio Gagliardi Cozman, Cassio Polpo de Campos, Jaime Shinsuke Ide, José Carlos Ferreira da Rocha:
Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitat. UAI 2004: 104-111 - 2003
- [c1]José Carlos Ferreira da Rocha, Fábio Gagliardi Cozman, Cassio Polpo de Campos:
Inference in Polytrees with Sets of Probabilities. UAI 2003: 217-224
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.
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.
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.
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-05-30 20:44 CEST 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:
