ReP USP - Resultado da busca

Trabalho de evento
Closed-form solutions in learning probabilistic logic programs by exact score maximization (2017)
Faria, Francisco Henrique Otte Vieira de ; Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: International Conference on Scalable Uncertainty Management - SUM. Unidades: EP, IME
Subjects: 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 e COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Closed-form solutions in learning probabilistic logic programs by exact score maximization. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-67582-4_9. Acesso em: 10 jun. 2024.
APA
Faria, F. H. O. V. de, Cozman, F. G., & Mauá, D. D. (2017). Closed-form solutions in learning probabilistic logic programs by exact score maximization. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-67582-4_9
NLM
Faria FHOV de, Cozman FG, Mauá DD. Closed-form solutions in learning probabilistic logic programs by exact score maximization [Internet]. Proceedings. 2017 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-67582-4_9
Vancouver
Faria FHOV de, Cozman FG, Mauá DD. Closed-form solutions in learning probabilistic logic programs by exact score maximization [Internet]. Proceedings. 2017 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-67582-4_9
Artigo de periodico
The effect of combination functions on the complexity of relational Bayesian networks (2017)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: 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: 10 jun. 2024.
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 2024 jun. 10 ] 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 2024 jun. 10 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Trabalho de evento-anais periodico
Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming (2017)
Bueno, Thiago Pereira; Mauá, Denis Deratani ; Barros, Leliane Nunes de ; Cozman, Fabio Gagliardi
Source: PMLR: Proceedings of Machine Learning Research. Conference titles: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: IME, EP
Subjects: PROCESSOS DE MARKOV, PROGRAMAÇÃO LÓGICA, MODELOS PARA PROCESSOS ESTOCÁSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Thiago Pereira et al. Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming. PMLR: Proceedings of Machine Learning Research. Brookline: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: http://proceedings.mlr.press/v62/bueno17a.html. Acesso em: 10 jun. 2024. , 2017
APA
Bueno, T. P., Mauá, D. D., Barros, L. N. de, & Cozman, F. G. (2017). Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming. PMLR: Proceedings of Machine Learning Research. Brookline: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de http://proceedings.mlr.press/v62/bueno17a.html
NLM
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming [Internet]. PMLR: Proceedings of Machine Learning Research. 2017 ;( 62): 49-60.[citado 2024 jun. 10 ] Available from: http://proceedings.mlr.press/v62/bueno17a.html
Vancouver
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Modeling Markov decision processes with imprecise probabilities using probabilistic logic programming [Internet]. PMLR: Proceedings of Machine Learning Research. 2017 ;( 62): 49-60.[citado 2024 jun. 10 ] Available from: http://proceedings.mlr.press/v62/bueno17a.html
Trabalho de evento
The complexity of inferences and explanations in probabilistic logic programming (2017)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Conference titles: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty - ECSQARU 2017. Unidades: IME, EP
Subjects: ESTATÍSTICA E PROBABILIDADE, GEOMETRIA E MODELAGEM COMPUTACIONAL
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 complexity of inferences and explanations in probabilistic logic programming. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-61581-3_40. Acesso em: 10 jun. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2017). The complexity of inferences and explanations in probabilistic logic programming. In Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Cham: Springer. doi:10.1007/978-3-319-61581-3_40
NLM
Cozman FG, Mauá DD. The complexity of inferences and explanations in probabilistic logic programming [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_40
Vancouver
Cozman FG, Mauá DD. The complexity of inferences and explanations in probabilistic logic programming [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_40
Trabalho de evento-anais periodico
The effect of combination functions on the complexity of relational Bayesian networks (2016)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Journal of Machine Learning Research. Conference titles: International Conference on Probabilistic Graphical Models - PMLR. Unidades: EP, IME
Subjects: INFERÊNCIA BAYESIANA, INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO PROBABILÍSTICO
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. Journal of Machine Learning Research. Brookline: Escola Politécnica, Universidade de São Paulo. Disponível em: http://proceedings.mlr.press/v52/maua16.pdf. Acesso em: 10 jun. 2024. , 2016
APA
Mauá, D. D., & Cozman, F. G. (2016). The effect of combination functions on the complexity of relational Bayesian networks. Journal of Machine Learning Research. Brookline: Escola Politécnica, Universidade de São Paulo. Recuperado de http://proceedings.mlr.press/v52/maua16.pdf
NLM
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. Journal of Machine Learning Research. 2016 ;( 52): 333-344.[citado 2024 jun. 10 ] Available from: http://proceedings.mlr.press/v52/maua16.pdf
Vancouver
Mauá DD, Cozman FG. The effect of combination functions on the complexity of relational Bayesian networks [Internet]. Journal of Machine Learning Research. 2016 ;( 52): 333-344.[citado 2024 jun. 10 ] Available from: http://proceedings.mlr.press/v52/maua16.pdf
Trabalho de evento-anais periodico
The structure and complexity of credal semantics (2016)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: CEUR Workshop Proceedings. Conference titles: International Workshop on Probabilistic Logic Programming- PLP. Unidades: EP, IME
Subjects: INTELIGÊNCIA ARTIFICIAL, ANÁLISE MULTIVARIADA, 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 structure and complexity of credal semantics. CEUR Workshop Proceedings. Aachen: CEUR Workshop Proceedings. Disponível em: http://ceur-ws.org/Vol-1661/paper-01.pdf. Acesso em: 10 jun. 2024. , 2016
APA
Cozman, F. G., & Mauá, D. D. (2016). The structure and complexity of credal semantics. CEUR Workshop Proceedings. Aachen: CEUR Workshop Proceedings. Recuperado de http://ceur-ws.org/Vol-1661/paper-01.pdf
NLM
Cozman FG, Mauá DD. The structure and complexity of credal semantics [Internet]. CEUR Workshop Proceedings. 2016 ; 1661 3-14.[citado 2024 jun. 10 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.pdf
Vancouver
Cozman FG, Mauá DD. The structure and complexity of credal semantics [Internet]. CEUR Workshop Proceedings. 2016 ; 1661 3-14.[citado 2024 jun. 10 ] Available from: http://ceur-ws.org/Vol-1661/paper-01.pdf
Trabalho de evento-anais periodico
Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit (2016)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Journal of Machine Learning Research. Conference titles: International Conference on Probabilistic Graphical Models - PMLR. Unidades: EP, IME
Subjects: LÓGICA MATEMÁTICA, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit. Journal of Machine Learning Research. Brookline: Escola Politécnica, Universidade de São Paulo. Disponível em: http://proceedings.mlr.press/v52/cozman16.pdf. Acesso em: 10 jun. 2024. , 2016
APA
Cozman, F. G., & Mauá, D. D. (2016). Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit. Journal of Machine Learning Research. Brookline: Escola Politécnica, Universidade de São Paulo. Recuperado de http://proceedings.mlr.press/v52/cozman16.pdf
NLM
Cozman FG, Mauá DD. Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit [Internet]. Journal of Machine Learning Research. 2016 ;( 52): 110-121.[citado 2024 jun. 10 ] Available from: http://proceedings.mlr.press/v52/cozman16.pdf
Vancouver
Cozman FG, Mauá DD. Probabilistic graphical models specified by probabilistic logic programs: semantics and complexit [Internet]. Journal of Machine Learning Research. 2016 ;( 52): 110-121.[citado 2024 jun. 10 ] Available from: http://proceedings.mlr.press/v52/cozman16.pdf
Artigo de periodico
Fast local search methods for solving limited memory influence diagrams (2016)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: International Journal of Approximate Reasoning. Unidades: IME, EP
Subjects: 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: 10 jun. 2024.
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 2024 jun. 10 ] 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 2024 jun. 10 ] Available from: https://doi.org/10.1016/j.ijar.2015.05.003
Trabalho de evento
On the complexity of propositional and relational credal networks (2015)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: EP, IME
Subjects: PROBABILIDADE, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
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. 2015, Anais.. Ariccia: Aracne, 2015. Disponível em: http://sipta.org/isipta15/data/paper/1.pdf. Acesso em: 10 jun. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2015). On the complexity of propositional and relational credal networks. In Proceedings. Ariccia: Aracne. Recuperado de http://sipta.org/isipta15/data/paper/1.pdf
NLM
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: http://sipta.org/isipta15/data/paper/1.pdf
Vancouver
Cozman FG, Mauá DD. On the complexity of propositional and relational credal networks [Internet]. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: http://sipta.org/isipta15/data/paper/1.pdf
Trabalho de evento
DL-Lite Bayesian networks: a tractable probabilistic graphical model (2015)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Conference titles: International Conference on Scalable Uncertainty Management - SUM. Unidades: IME, EP
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, COMPUTABILIDADE E COMPLEXIDADE, 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. DL-Lite Bayesian networks: a tractable probabilistic graphical model. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-23540-0_4. Acesso em: 10 jun. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2015). DL-Lite Bayesian networks: a tractable probabilistic graphical model. In Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-23540-0_4
NLM
Mauá DD, Cozman FG. DL-Lite Bayesian networks: a tractable probabilistic graphical model [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_4
Vancouver
Mauá DD, Cozman FG. DL-Lite Bayesian networks: a tractable probabilistic graphical model [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_4
Trabalho de evento
Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity (2015)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Proceedings. Conference titles: AAAI Conference on Artificial Intelligence. Unidades: EP, IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. 2015, Anais.. Palo Alto: AAAI Press, 2015. Disponível em: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312. Acesso em: 10 jun. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2015). Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity. In Proceedings. Palo Alto: AAAI Press. Recuperado de http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
NLM
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
Vancouver
Cozman FG, Mauá DD. Bayesian networks specified using propositional and relational constructs: combined, data, and domain complexity [Internet]. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9312
Artigo de periodico
Generalized probabilistic satisfiability through integer programming (2015)
De Bona, Glauber ; Cozman, Fabio Gagliardi ; Finger, Marcelo
Source: Journal of the Brazilian Computer Society. Unidades: EP, IME
Subjects: RACIOCÍNIO PROBABILÍSTICO, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DE BONA, Glauber e COZMAN, Fabio Gagliardi e FINGER, Marcelo. Generalized probabilistic satisfiability through integer programming. Journal of the Brazilian Computer Society, v. 21, p. 14 , 2015Tradução . . Disponível em: https://doi.org/10.1186/s13173-015-0028-x. Acesso em: 10 jun. 2024.
APA
De Bona, G., Cozman, F. G., & Finger, M. (2015). Generalized probabilistic satisfiability through integer programming. Journal of the Brazilian Computer Society, 21, 14 . doi:10.1186/s13173-015-0028-x
NLM
De Bona G, Cozman FG, Finger M. Generalized probabilistic satisfiability through integer programming [Internet]. Journal of the Brazilian Computer Society. 2015 ; 21 14 .[citado 2024 jun. 10 ] Available from: https://doi.org/10.1186/s13173-015-0028-x
Vancouver
De Bona G, Cozman FG, Finger M. Generalized probabilistic satisfiability through integer programming [Internet]. Journal of the Brazilian Computer Society. 2015 ; 21 14 .[citado 2024 jun. 10 ] Available from: https://doi.org/10.1186/s13173-015-0028-x
Trabalho de evento
The complexity of MAP inference in Bayesian networks specified through logical languages (2015)
Mauá, Denis Deratani ; Campos, Cassio Polpo de; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: International Joint Conference on Artificial Intelligence - IJCAI. Unidades: IME, EP
Subjects: COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MAUÁ, Denis Deratani e CAMPOS, Cassio Polpo de e COZMAN, Fabio Gagliardi. The complexity of MAP inference in Bayesian networks specified through logical languages. 2015, Anais.. Palo Alto: AAAI Press / International Joint Conferences on Artificial Intelligence, 2015. Disponível em: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf. Acesso em: 10 jun. 2024.
APA
Mauá, D. D., Campos, C. P. de, & Cozman, F. G. (2015). The complexity of MAP inference in Bayesian networks specified through logical languages. In Proceedings. Palo Alto: AAAI Press / International Joint Conferences on Artificial Intelligence. Recuperado de http://ijcai.org/papers15/Papers/IJCAI15-130.pdf
NLM
Mauá DD, Campos CP de, Cozman FG. The complexity of MAP inference in Bayesian networks specified through logical languages [Internet]. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf
Vancouver
Mauá DD, Campos CP de, Cozman FG. The complexity of MAP inference in Bayesian networks specified through logical languages [Internet]. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: http://ijcai.org/papers15/Papers/IJCAI15-130.pdf
Trabalho de evento
The complexity of plate probabilistic models (2015)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Conference titles: International Conference on Scalable Uncertainty Management - SUM. Unidades: IME, EP
Subjects: COMPUTABILIDADE E COMPLEXIDADE, 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. The complexity of plate probabilistic models. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-23540-0_3. Acesso em: 10 jun. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2015). The complexity of plate probabilistic models. In Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-23540-0_3
NLM
Mauá DD, Cozman FG. The complexity of plate probabilistic models [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_3
Vancouver
Mauá DD, Cozman FG. The complexity of plate probabilistic models [Internet]. Scalable Uncertainty Management: 9th International Conference, SUM 2015, Québec City, QC, Canada, September 16-18, 2015. Proceedings. 2015 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_3
Trabalho de evento
Specifying probabilistic relational models with description logics (2015)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Source: Anais. Conference titles: Encontro Nacional de Inteligência Artificial e Computacional - ENIAC. Unidades: EP, IME
Subjects: MODELOS PARA PROCESSOS ESTOCÁSTICOS, INFERÊNCIA BAYESIANA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e MAUÁ, Denis Deratani. Specifying probabilistic relational models with description logics. 2015, Anais.. Porto Alegre: SBC, 2015. Disponível em: http://www.lbd.dcc.ufmg.br/colecoes/eniac/2015/016.pdf. Acesso em: 10 jun. 2024.
APA
Cozman, F. G., & Mauá, D. D. (2015). Specifying probabilistic relational models with description logics. In Anais. Porto Alegre: SBC. Recuperado de http://www.lbd.dcc.ufmg.br/colecoes/eniac/2015/016.pdf
NLM
Cozman FG, Mauá DD. Specifying probabilistic relational models with description logics [Internet]. Anais. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.lbd.dcc.ufmg.br/colecoes/eniac/2015/016.pdf
Vancouver
Cozman FG, Mauá DD. Specifying probabilistic relational models with description logics [Internet]. Anais. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.lbd.dcc.ufmg.br/colecoes/eniac/2015/016.pdf
Trabalho de evento
Bayesian networks of bounded treewidth: a performance analysis (2015)
Machado, Fabio Henrique Santana; Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Anais. Conference titles: Encontro Nacional de Inteligência Artificial e Computacional - ENIAC. Unidades: IME, EP
Subjects: INTELIGÊNCIA ARTIFICIAL, INFERÊNCIA BAYESIANA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MACHADO, Fabio Henrique Santana e MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi. Bayesian networks of bounded treewidth: a performance analysis. 2015, Anais.. Porto Alegre: SBC, 2015. Disponível em: http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23731. Acesso em: 10 jun. 2024.
APA
Machado, F. H. S., Mauá, D. D., & Cozman, F. G. (2015). Bayesian networks of bounded treewidth: a performance analysis. In Anais. Porto Alegre: SBC. Recuperado de http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23731
NLM
Machado FHS, Mauá DD, Cozman FG. Bayesian networks of bounded treewidth: a performance analysis [Internet]. Anais. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23731
Vancouver
Machado FHS, Mauá DD, Cozman FG. Bayesian networks of bounded treewidth: a performance analysis [Internet]. Anais. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23731
Trabalho de evento
A tractable class of model counting problems (2015)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Source: Anais. Conference titles: Encontro Nacional de Inteligência Artificial e Computacional - ENIAC. Unidades: IME, EP
Assunto: 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 e COZMAN, Fabio Gagliardi. A tractable class of model counting problems. 2015, Anais.. Porto Alegre: SBC, 2015. Disponível em: http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23724. Acesso em: 10 jun. 2024.
APA
Mauá, D. D., & Cozman, F. G. (2015). A tractable class of model counting problems. In Anais. Porto Alegre: SBC. Recuperado de http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23724
NLM
Mauá DD, Cozman FG. A tractable class of model counting problems [Internet]. Anais. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23724
Vancouver
Mauá DD, Cozman FG. A tractable class of model counting problems [Internet]. Anais. 2015 ;[citado 2024 jun. 10 ] Available from: http://www.lbd.dcc.ufmg.br/bdbcomp/servlet/Trabalho?id=23724
Artigo de periodico
Towards classifying propositional probabilistic logics (2014)
De Bona, Glauber ; Cozman, Fabio Gagliardi ; Finger, Marcelo
Source: Journal of Applied Logic. Unidades: EP, IME
Subjects: INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO PROBABILÍSTICO, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DE BONA, Glauber e COZMAN, Fabio Gagliardi e FINGER, Marcelo. Towards classifying propositional probabilistic logics. Journal of Applied Logic, v. 12, n. 3, p. 349-368, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.jal.2014.01.005. Acesso em: 10 jun. 2024.
APA
De Bona, G., Cozman, F. G., & Finger, M. (2014). Towards classifying propositional probabilistic logics. Journal of Applied Logic, 12( 3), 349-368. doi:10.1016/j.jal.2014.01.005
NLM
De Bona G, Cozman FG, Finger M. Towards classifying propositional probabilistic logics [Internet]. Journal of Applied Logic. 2014 ; 12( 3): 349-368.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1016/j.jal.2014.01.005
Vancouver
De Bona G, Cozman FG, Finger M. Towards classifying propositional probabilistic logics [Internet]. Journal of Applied Logic. 2014 ; 12( 3): 349-368.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1016/j.jal.2014.01.005
Trabalho de evento
Factored Markov decision process with imprecise transition probabilities (2014)
Delgado, Karina Valdivia; Barros, Leliane Nunes de ; Sanner, Scott; Cozman, Fabio Gagliardi
Source: Proceedings. Conference titles: International Conference on Automated Planning and Scheduling - ICAPS. Unidades: EACH, IME, EP
Subjects: PROCESSOS DE MARKOV, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELGADO, Karina Valdivia et al. Factored Markov decision process with imprecise transition probabilities. 2014, Anais.. Palo Alto: AAAI, 2014. Disponível em: http://icaps14.icaps-conference.org/proceedings/mppu/MPPU_proceedings.pdf#page=5. Acesso em: 10 jun. 2024.
APA
Delgado, K. V., Barros, L. N. de, Sanner, S., & Cozman, F. G. (2014). Factored Markov decision process with imprecise transition probabilities. In Proceedings. Palo Alto: AAAI. Recuperado de http://icaps14.icaps-conference.org/proceedings/mppu/MPPU_proceedings.pdf#page=5
NLM
Delgado KV, Barros LN de, Sanner S, Cozman FG. Factored Markov decision process with imprecise transition probabilities [Internet]. Proceedings. 2014 ;[citado 2024 jun. 10 ] Available from: http://icaps14.icaps-conference.org/proceedings/mppu/MPPU_proceedings.pdf#page=5
Vancouver
Delgado KV, Barros LN de, Sanner S, Cozman FG. Factored Markov decision process with imprecise transition probabilities [Internet]. Proceedings. 2014 ;[citado 2024 jun. 10 ] Available from: http://icaps14.icaps-conference.org/proceedings/mppu/MPPU_proceedings.pdf#page=5
Trabalho de evento
Generalized probabilistic satisfiability (2013)
De Bona, Glauber ; Cozman, Fabio Gagliardi ; Finger, Marcelo
Source: Proceeding. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidades: EP, IME
Assunto: LÓGICA FORMAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DE BONA, Glauber e COZMAN, Fabio Gagliardi e FINGER, Marcelo. Generalized probabilistic satisfiability. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/BRACIS.2013.38. Acesso em: 10 jun. 2024.
APA
De Bona, G., Cozman, F. G., & Finger, M. (2013). Generalized probabilistic satisfiability. In Proceeding. Piscataway: IEEE. doi:10.1109/BRACIS.2013.38
NLM
De Bona G, Cozman FG, Finger M. Generalized probabilistic satisfiability [Internet]. Proceeding. 2013 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1109/BRACIS.2013.38
Vancouver
De Bona G, Cozman FG, Finger M. Generalized probabilistic satisfiability [Internet]. Proceeding. 2013 ;[citado 2024 jun. 10 ] Available from: https://doi.org/10.1109/BRACIS.2013.38

USP Schools

ReP

Filtros

USP Schools

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Non normalized affiliation