ReP USP - Resultado da busca

Artigo de periodico
The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (2020)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Fonte: International Journal of Approximate Reasoning. Unidades: EP, IME
Assuntos: PROGRAMAÇÃO LÓGICA, COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, v. 125, p. 218-239, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.07.004. Acesso em: 09 nov. 2025.
APA
Cozman, F. G., & Mauá, D. D. (2020). The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, 125, 218-239. doi:10.1016/j.ijar.2020.07.004
NLM
Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Vancouver
Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
Artigo de periodico
Complexity results for probabilistic answer set programming (2020)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidades: IME, EP
Assunto: COMPUTABILIDADE E COMPLEXIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Complexity results for probabilistic answer set programming. International Journal of Approximate Reasoning, v. 118, p. 133-154, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.12.003. Acesso em: 09 nov. 2025.
APA
Mauá, D. D., & Cozman, F. G. (2020). Complexity results for probabilistic answer set programming. International Journal of Approximate Reasoning, 118, 133-154. doi:10.1016/j.ijar.2019.12.003
NLM
Mauá DD, Cozman FG. Complexity results for probabilistic answer set programming [Internet]. International Journal of Approximate Reasoning. 2020 ;118 133-154.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Vancouver
Mauá DD, Cozman FG. Complexity results for probabilistic answer set programming [Internet]. International Journal of Approximate Reasoning. 2020 ;118 133-154.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2019.12.003
Artigo de periodico
Thirty years of credal networks: specification, algorithms and complexity (2020)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidades: IME, EP
Assuntos: MODELOS PARA PROCESSOS ESTOCÁSTICOS, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, v. 126, p. 133-157, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.08.009. Acesso em: 09 nov. 2025.
APA
Mauá, D. D., & Cozman, F. G. (2020). Thirty years of credal networks: specification, algorithms and complexity. International Journal of Approximate Reasoning, 126, 133-157. doi:10.1016/j.ijar.2020.08.009
NLM
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009
Vancouver
Mauá DD, Cozman FG. Thirty years of credal networks: specification, algorithms and complexity [Internet]. International Journal of Approximate Reasoning. 2020 ; 126 133-157.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2020.08.009
Artigo de periodico
The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws (2019)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Fonte: International Journal of Approximate Reasoning. Unidades: EP, IME
Assuntos: TEORIA DA COMPUTAÇÃO, TEORIA DOS MODELOS, AQUISIÇÃO DE CONHECIMENTO, LÓGICA MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, v. 110, p. 107-126, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2019.04.003. Acesso em: 09 nov. 2025.
APA
Cozman, F. G., & Mauá, D. D. (2019). The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws. International Journal of Approximate Reasoning, 110, 107-126. doi:10.1016/j.ijar.2019.04.003
NLM
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Vancouver
Cozman FG, Mauá DD. The finite model theory of Bayesian network specifications: Descriptive complexity and zero/one laws [Internet]. International Journal of Approximate Reasoning. 2019 ; 110 107-126.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2019.04.003
Artigo de periodico
Speeding up parameter and rule learning for acyclic probabilistic logic programs (2019)
Faria, Francisco Henrique Otte Vieira de ; Gusmão, Arthur Colombini ; De Bona, Glauber ; Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidades: EP, IME
Assuntos: PROGRAMAÇÃO LÓGICA, APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FARIA, Francisco Henrique Otte Vieira de et al. Speeding up parameter and rule learning for acyclic probabilistic logic programs. International Journal of Approximate Reasoning, v. 106, p. 32-50, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.12.012. Acesso em: 09 nov. 2025.
APA
Faria, F. H. O. V. de, Gusmão, A. C., De Bona, G., Mauá, D. D., & Cozman, F. G. (2019). Speeding up parameter and rule learning for acyclic probabilistic logic programs. International Journal of Approximate Reasoning, 106, 32-50. doi:10.1016/j.ijar.2018.12.012
NLM
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Speeding up parameter and rule learning for acyclic probabilistic logic programs [Internet]. International Journal of Approximate Reasoning. 2019 ; 106 32-50.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.012
Vancouver
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Speeding up parameter and rule learning for acyclic probabilistic logic programs [Internet]. International Journal of Approximate Reasoning. 2019 ; 106 32-50.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2018.12.012
Artigo de periodico
Robustifying sum-product networks (2018)
Mauá, Denis Deratani ; Conaty, Diarmaid; Cozman, Fabio Gagliardi ; Poppenhaeger, Katja; Campos, Cassio Polpo de
Fonte: International Journal of Approximate Reasoning. Unidades: IME, EP
Assuntos: INTELIGÊNCIA ARTIFICIAL, MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani et al. Robustifying sum-product networks. International Journal of Approximate Reasoning, v. 101, p. 163-180, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2018.07.003. Acesso em: 09 nov. 2025.
APA
Mauá, D. D., Conaty, D., Cozman, F. G., Poppenhaeger, K., & Campos, C. P. de. (2018). Robustifying sum-product networks. International Journal of Approximate Reasoning, 101, 163-180. doi:10.1016/j.ijar.2018.07.003
NLM
Mauá DD, Conaty D, Cozman FG, Poppenhaeger K, Campos CP de. Robustifying sum-product networks [Internet]. International Journal of Approximate Reasoning. 2018 ; 101 163-180.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003
Vancouver
Mauá DD, Conaty D, Cozman FG, Poppenhaeger K, Campos CP de. Robustifying sum-product networks [Internet]. International Journal of Approximate Reasoning. 2018 ; 101 163-180.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2018.07.003
Artigo de periodico
On the complexity of propositional and relational credal networks (2017)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Fonte: International Journal of Approximate Reasoning. Unidades: EP, IME
Assuntos: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, TEORIA DOS GRAFOS, LÓGICA MATEMÁTICA, PROBABILIDADE, PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. On the complexity of propositional and relational credal networks. International Journal of Approximate Reasoning, v. 83, p. 298-319, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2016.10.008. Acesso em: 09 nov. 2025.
APA
Cozman, F. G., & Mauá, D. D. (2017). On the complexity of propositional and relational credal networks. International Journal of Approximate Reasoning, 83, 298-319. doi:10.1016/j.ijar.2016.10.008
NLM
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 83 298-319.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2016.10.008
Vancouver
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 83 298-319.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2016.10.008
Artigo de periodico
The effect of combination functions on the complexity of relational Bayesian networks (2017)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidades: IME, EP
Assuntos: CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO, ANÁLISE DE ALGORITMOS, ESTATÍSTICA, ANÁLISE MULTIVARIADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning, v. 85, p. 178-195, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2017.03.014. Acesso em: 09 nov. 2025.
APA
Mauá, D. D., & Cozman, F. G. (2017). The effect of combination functions on the complexity of relational Bayesian networks. International Journal of Approximate Reasoning, 85, 178-195. doi:10.1016/j.ijar.2017.03.014
NLM
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 85 178-195.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Vancouver
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. International Journal of Approximate Reasoning. 2017 ; 85 178-195.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Artigo de periodico
Fast local search methods for solving limited memory influence diagrams (2016)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidades: IME, EP
Assuntos: MODELOS PARA PROCESSOS ESTOCÁSTICOS, INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning, v. 68, n. Ja 2016, p. 230-245, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2015.05.003. Acesso em: 09 nov. 2025.
APA
Mauá, D. D., & Cozman, F. G. (2016). Fast local search methods for solving limited memory influence diagrams. International Journal of Approximate Reasoning, 68( Ja 2016), 230-245. doi:10.1016/j.ijar.2015.05.003
NLM
Mauá DD, Cozman FG. Fast local search methods for solving limited memory influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 230-245.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2015.05.003
Vancouver
Mauá DD, Cozman FG. Fast local search methods for solving limited memory influence diagrams [Internet]. International Journal of Approximate Reasoning. 2016 ; 68( Ja 2016): 230-245.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2015.05.003
Artigo de periodico
Learning imprecise probability models: conceptual and practical challenges (2014)
Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: PROBABILIDADE, INFERÊNCIA BAYESIANA, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi. Learning imprecise probability models: conceptual and practical challenges. International Journal of Approximate Reasoning, v. 55, n. 7, p. 1594-1596, 2014Tradução . . Disponível em: http://www.sciencedirect.com/science/article/pii/S0888613X14000772#. Acesso em: 09 nov. 2025.
APA
Cozman, F. G. (2014). Learning imprecise probability models: conceptual and practical challenges. International Journal of Approximate Reasoning, 55( 7), 1594-1596. doi:10.1016/j.ijar.2013.09.019
NLM
Cozman FG. Learning imprecise probability models: conceptual and practical challenges [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( 7): 1594-1596.[citado 2025 nov. 09 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X14000772#
Vancouver
Cozman FG. Learning imprecise probability models: conceptual and practical challenges [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( 7): 1594-1596.[citado 2025 nov. 09 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X14000772#
Artigo de periodico
Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms (2014)
Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: PROBABILIDADE, INFERÊNCIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de. Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms. International Journal of Approximate Reasoning, v. 55, n. Ja 2014, p. 666\2013682, 2014Tradução . . Disponível em: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X. Acesso em: 09 nov. 2025.
APA
Cozman, F. G., & Campos, C. P. de. (2014). Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms. International Journal of Approximate Reasoning, 55( Ja 2014), 666\2013682. doi:10.1016/j.ijar.2013.09.013
NLM
Cozman FG, Campos CP de. Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( Ja 2014): 666\2013682.[citado 2025 nov. 09 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X
Vancouver
Cozman FG, Campos CP de. Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms [Internet]. International Journal of Approximate Reasoning. 2014 ; 55( Ja 2014): 666\2013682.[citado 2025 nov. 09 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X
Artigo de periodico
Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (2011)
Delgado, Karina Valdivia; Barros, Leliane Nunes de ; Cozman, Fabio Gagliardi ; Sanner, Scott
Fonte: International Journal of Approximate Reasoning. Unidades: EACH, IME, EP
Assunto: PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELGADO, Karina Valdivia et al. Using mathematical programming to solve factored Markov decision processes with imprecise probabilities. International Journal of Approximate Reasoning, v. 52, p. 1000-1017, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2011.04.002. Acesso em: 09 nov. 2025.
APA
Delgado, K. V., Barros, L. N. de, Cozman, F. G., & Sanner, S. (2011). Using mathematical programming to solve factored Markov decision processes with imprecise probabilities. International Journal of Approximate Reasoning, 52, 1000-1017. doi:10.1016/j.ijar.2011.04.002
NLM
Delgado KV, Barros LN de, Cozman FG, Sanner S. Using mathematical programming to solve factored Markov decision processes with imprecise probabilities [Internet]. International Journal of Approximate Reasoning. 2011 ; 52 1000-1017.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2011.04.002
Vancouver
Delgado KV, Barros LN de, Cozman FG, Sanner S. Using mathematical programming to solve factored Markov decision processes with imprecise probabilities [Internet]. International Journal of Approximate Reasoning. 2011 ; 52 1000-1017.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2011.04.002
Artigo de periodico
Concentration inequalities and laws of large numbers under epistemic and regular irrelevance (2010)
Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assunto: PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi. Concentration inequalities and laws of large numbers under epistemic and regular irrelevance. International Journal of Approximate Reasoning, v. 51, n. 9, p. 1069-1084, 2010Tradução . . Disponível em: http://ac.els-cdn.com/S0888613X10001040/1-s2.0-S0888613X10001040-main.pdf?_tid=1e24c122-9259-11e2-a60c-00000aab0f26&acdnat=1363892403_9fce150d8810cd456df1cf4f4abcb38d. Acesso em: 09 nov. 2025.
APA
Cozman, F. G. (2010). Concentration inequalities and laws of large numbers under epistemic and regular irrelevance. International Journal of Approximate Reasoning, 51( 9), 1069-1084. doi:10.1016/j.ijar.2010.08.009
NLM
Cozman FG. Concentration inequalities and laws of large numbers under epistemic and regular irrelevance [Internet]. International Journal of Approximate Reasoning. 2010 ; 51( 9): 1069-1084.[citado 2025 nov. 09 ] Available from: http://ac.els-cdn.com/S0888613X10001040/1-s2.0-S0888613X10001040-main.pdf?_tid=1e24c122-9259-11e2-a60c-00000aab0f26&acdnat=1363892403_9fce150d8810cd456df1cf4f4abcb38d
Vancouver
Cozman FG. Concentration inequalities and laws of large numbers under epistemic and regular irrelevance [Internet]. International Journal of Approximate Reasoning. 2010 ; 51( 9): 1069-1084.[citado 2025 nov. 09 ] Available from: http://ac.els-cdn.com/S0888613X10001040/1-s2.0-S0888613X10001040-main.pdf?_tid=1e24c122-9259-11e2-a60c-00000aab0f26&acdnat=1363892403_9fce150d8810cd456df1cf4f4abcb38d
Artigo de periodico
Probabilistic logic with independence (2008)
Cozman, Fabio Gagliardi ; Campos, Cassio Polpo de; Rocha, José Carlos Ferreira da
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: LÓGICA, REDES NEURAIS, TEORIA DOS GRAFOS, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e CAMPOS, Cassio Polpo de e ROCHA, José Carlos Ferreira da. Probabilistic logic with independence. International Journal of Approximate Reasoning, v. 49, n. 1, p. 03 -17, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2007.08.002. Acesso em: 09 nov. 2025.
APA
Cozman, F. G., Campos, C. P. de, & Rocha, J. C. F. da. (2008). Probabilistic logic with independence. International Journal of Approximate Reasoning, 49( 1), 03 -17. doi:10.1016/j.ijar.2007.08.002
NLM
Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with independence [Internet]. International Journal of Approximate Reasoning. 2008 ; 49( 1): 03 -17.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2007.08.002
Vancouver
Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with independence [Internet]. International Journal of Approximate Reasoning. 2008 ; 49( 1): 03 -17.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2007.08.002
Artigo de periodico
Approximate algorithms for credal networks with binary variables (2008)
Ide, Jaime Shinsuke; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: ALGORITMOS, REDES NEURAIS, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Approximate algorithms for credal networks with binary variables. International Journal of Approximate Reasoning, v. 48, n. 1, p. 275-296, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2007.09.003. Acesso em: 09 nov. 2025.
APA
Ide, J. S., & Cozman, F. G. (2008). Approximate algorithms for credal networks with binary variables. International Journal of Approximate Reasoning, 48( 1), 275-296. doi:10.1016/j.ijar.2007.09.003
NLM
Ide JS, Cozman FG. Approximate algorithms for credal networks with binary variables [Internet]. International Journal of Approximate Reasoning. 2008 ; 48( 1): 275-296.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2007.09.003
Vancouver
Ide JS, Cozman FG. Approximate algorithms for credal networks with binary variables [Internet]. International Journal of Approximate Reasoning. 2008 ; 48( 1): 275-296.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2007.09.003
Artigo de periodico
Computing lower and upper expectations under epistemic independence (2007)
Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: PROGRAMAÇÃO LINEAR, PROBABILIDADE, MODELOS MATEMÁTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. Computing lower and upper expectations under epistemic independence. International Journal of Approximate Reasoning, v. 44, n. 3, p. 244-260, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2006.07.013. Acesso em: 09 nov. 2025.
APA
Campos, C. P. de, & Cozman, F. G. (2007). Computing lower and upper expectations under epistemic independence. International Journal of Approximate Reasoning, 44( 3), 244-260. doi:10.1016/j.ijar.2006.07.013
NLM
Campos CP de, Cozman FG. Computing lower and upper expectations under epistemic independence [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 244-260.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2006.07.013
Vancouver
Campos CP de, Cozman FG. Computing lower and upper expectations under epistemic independence [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 244-260.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2006.07.013
Artigo de periodico
Reasonig with imprecise probabilities (Special issue) [Editor convidado] (2007)
Cano, Andrés; Cozman, Fabio Gagliardi ; Lukasiewicz, Thomas
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: INTELIGÊNCIA ARTIFICIAL, LÓGICA MATEMÁTICA, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CANO, Andrés e COZMAN, Fabio Gagliardi e LUKASIEWICZ, Thomas. Reasonig with imprecise probabilities (Special issue) [Editor convidado]. International Journal of Approximate Reasoning, v. 44, n. 3, p. 197-199, 2007Tradução . . Disponível em: https://repositorio.usp.br/directbitstream/4d8c9a09-ec2d-48e3-849c-e8dba25cf136/Cozman-2007-reasoning%20with%20imprecise%20probabilities.pdf. Acesso em: 09 nov. 2025.
APA
Cano, A., Cozman, F. G., & Lukasiewicz, T. (2007). Reasonig with imprecise probabilities (Special issue) [Editor convidado]. International Journal of Approximate Reasoning, 44( 3), 197-199. Recuperado de https://repositorio.usp.br/directbitstream/4d8c9a09-ec2d-48e3-849c-e8dba25cf136/Cozman-2007-reasoning%20with%20imprecise%20probabilities.pdf
NLM
Cano A, Cozman FG, Lukasiewicz T. Reasonig with imprecise probabilities (Special issue) [Editor convidado] [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 197-199.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/4d8c9a09-ec2d-48e3-849c-e8dba25cf136/Cozman-2007-reasoning%20with%20imprecise%20probabilities.pdf
Vancouver
Cano A, Cozman FG, Lukasiewicz T. Reasonig with imprecise probabilities (Special issue) [Editor convidado] [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 197-199.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/4d8c9a09-ec2d-48e3-849c-e8dba25cf136/Cozman-2007-reasoning%20with%20imprecise%20probabilities.pdf
Artigo de periodico
Notes on "notes on conditional previsions" (2007)
Vicig, Paolo; Zaffalon, Marco; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: INTELIGÊNCIA ARTIFICIAL, LÓGICA MATEMÁTICA, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VICIG, Paolo e ZAFFALON, Marco e COZMAN, Fabio Gagliardi. Notes on "notes on conditional previsions". International Journal of Approximate Reasoning, v. 44, n. 3, p. 358-365, 2007Tradução . . Disponível em: https://repositorio.usp.br/directbitstream/d139b8f0-fbe6-4011-bb5a-cfce2aa4f0bb/Cozman-2007-Notes%20on%20-%20notes%20on%20conditional%20previsions.pdf. Acesso em: 09 nov. 2025.
APA
Vicig, P., Zaffalon, M., & Cozman, F. G. (2007). Notes on "notes on conditional previsions". International Journal of Approximate Reasoning, 44( 3), 358-365. Recuperado de https://repositorio.usp.br/directbitstream/d139b8f0-fbe6-4011-bb5a-cfce2aa4f0bb/Cozman-2007-Notes%20on%20-%20notes%20on%20conditional%20previsions.pdf
NLM
Vicig P, Zaffalon M, Cozman FG. Notes on "notes on conditional previsions" [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 358-365.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/d139b8f0-fbe6-4011-bb5a-cfce2aa4f0bb/Cozman-2007-Notes%20on%20-%20notes%20on%20conditional%20previsions.pdf
Vancouver
Vicig P, Zaffalon M, Cozman FG. Notes on "notes on conditional previsions" [Internet]. International Journal of Approximate Reasoning. 2007 ; 44( 3): 358-365.[citado 2025 nov. 09 ] Available from: https://repositorio.usp.br/directbitstream/d139b8f0-fbe6-4011-bb5a-cfce2aa4f0bb/Cozman-2007-Notes%20on%20-%20notes%20on%20conditional%20previsions.pdf
Artigo de periodico
Anytime anyspace probabilistic inference (2005)
Ramos, Fabio Tozeto; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: INFERÊNCIA BAYESIANA, INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAMOS, Fabio Tozeto e COZMAN, Fabio Gagliardi. Anytime anyspace probabilistic inference. International Journal of Approximate Reasoning, v. 38, n. ja, p. 53-80, 2005Tradução . . Disponível em: https://doi.org/10.1016/s0888-613x(04)00047-7. Acesso em: 09 nov. 2025.
APA
Ramos, F. T., & Cozman, F. G. (2005). Anytime anyspace probabilistic inference. International Journal of Approximate Reasoning, 38( ja), 53-80. doi:10.1016/s0888-613x(04)00047-7
NLM
Ramos FT, Cozman FG. Anytime anyspace probabilistic inference [Internet]. International Journal of Approximate Reasoning. 2005 ;38( ja): 53-80.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/s0888-613x(04)00047-7
Vancouver
Ramos FT, Cozman FG. Anytime anyspace probabilistic inference [Internet]. International Journal of Approximate Reasoning. 2005 ;38( ja): 53-80.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/s0888-613x(04)00047-7
Artigo de periodico
Inference in credal networks: branch-and-bound methods and the A/R+ algorithm (2005)
Rocha, José Carlos Ferreira da; Cozman, Fabio Gagliardi
Fonte: International Journal of Approximate Reasoning. Unidade: EP
Assuntos: INFERÊNCIA BAYESIANA, INTELIGÊNCIA ARTIFICIAL, MÉTODOS GRÁFICOS, REDES NEURAIS, PROBABILIDADE, MODELOS MATEMÁTICOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROCHA, José Carlos Ferreira da e COZMAN, Fabio Gagliardi. Inference in credal networks: branch-and-bound methods and the A/R+ algorithm. International Journal of Approximate Reasoning, v. 39, n. 2-3, p. 279-296, 2005Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2004.10.009. Acesso em: 09 nov. 2025.
APA
Rocha, J. C. F. da, & Cozman, F. G. (2005). Inference in credal networks: branch-and-bound methods and the A/R+ algorithm. International Journal of Approximate Reasoning, 39( 2-3), 279-296. doi:10.1016/j.ijar.2004.10.009
NLM
Rocha JCF da, Cozman FG. Inference in credal networks: branch-and-bound methods and the A/R+ algorithm [Internet]. International Journal of Approximate Reasoning. 2005 ; 39( 2-3): 279-296.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2004.10.009
Vancouver
Rocha JCF da, Cozman FG. Inference in credal networks: branch-and-bound methods and the A/R+ algorithm [Internet]. International Journal of Approximate Reasoning. 2005 ; 39( 2-3): 279-296.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.ijar.2004.10.009

Unidades USP

ReP

Filtros

Autores

Ano de publicação

Assuntos

Agência de fomento

Indexado em