ReP USP - Resultado da busca

Artigo de periodico
On the semantics and complexity of probabilistic logic programs (2017)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Fonte: Journal of Artificial Intelligence Research. Unidades: EP, IME
Assuntos: PROGRAMAÇÃO LÓGICA, 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. On the semantics and complexity of probabilistic logic programs. Journal of Artificial Intelligence Research, v. 60, p. 221-262, 2017Tradução . . Disponível em: https://doi.org/10.1613/jair.5482. Acesso em: 08 out. 2025.
APA
Cozman, F. G., & Mauá, D. D. (2017). On the semantics and complexity of probabilistic logic programs. Journal of Artificial Intelligence Research, 60, 221-262. doi:10.1613/jair.5482
NLM
Cozman FG, Mauá DD. On the semantics and complexity of probabilistic logic programs [Internet]. Journal of Artificial Intelligence Research. 2017 ; 60 221-262.[citado 2025 out. 08 ] Available from: https://doi.org/10.1613/jair.5482
Vancouver
Cozman FG, Mauá DD. On the semantics and complexity of probabilistic logic programs [Internet]. Journal of Artificial Intelligence Research. 2017 ; 60 221-262.[citado 2025 out. 08 ] Available from: https://doi.org/10.1613/jair.5482
Trabalho de evento-anais periodico
Credal sum-product networks (2017)
Mauá, Denis Deratani ; Cozman, Fabio Gagliardi ; Conaty, Diarmaid
Fonte: PMLR: Proceedings of Machine Learning Research. Nome do evento: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. 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 e COZMAN, Fabio Gagliardi e CONATY, Diarmaid. Credal sum-product networks. 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/mau*C3*A117a.html. Acesso em: 08 out. 2025. , 2017
APA
Mauá, D. D., Cozman, F. G., & Conaty, D. (2017). Credal sum-product networks. 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/mau*C3*A117a.html
NLM
Mauá DD, Cozman FG, Conaty D. Credal sum-product networks [Internet]. PMLR: Proceedings of Machine Learning Research. 2017 ;( 62): 205-216.[citado 2025 out. 08 ] Available from: http://proceedings.mlr.press/v62/mau*C3*A117a.html
Vancouver
Mauá DD, Cozman FG, Conaty D. Credal sum-product networks [Internet]. PMLR: Proceedings of Machine Learning Research. 2017 ;( 62): 205-216.[citado 2025 out. 08 ] Available from: http://proceedings.mlr.press/v62/mau*C3*A117a.html
Trabalho de evento
Markov decision processes specified by probabilistic logic programming: representation and solution (2017)
Bueno, Thiago Pereira; Mauá, Denis Deratani ; Barros, Leliane Nunes de ; Cozman, Fabio Gagliardi
Fonte: Proceedings. Nome do evento: Brazilian Conference on Intelligent Systems - BRACIS. Unidades: IME, EP
Assuntos: PROCESSOS DE MARKOV, PROGRAMAÇÃO LÓGICA, TOMADA DE DECISÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Thiago Pereira et al. Markov decision processes specified by probabilistic logic programming: representation and solution. 2017, Anais.. Piscataway: IEEE, 2017. Disponível em: https://doi.org/10.1109/BRACIS.2016.068. Acesso em: 08 out. 2025.
APA
Bueno, T. P., Mauá, D. D., Barros, L. N. de, & Cozman, F. G. (2017). Markov decision processes specified by probabilistic logic programming: representation and solution. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2016.068
NLM
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Markov decision processes specified by probabilistic logic programming: representation and solution [Internet]. Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1109/BRACIS.2016.068
Vancouver
Bueno TP, Mauá DD, Barros LN de, Cozman FG. Markov decision processes specified by probabilistic logic programming: representation and solution [Internet]. Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1109/BRACIS.2016.068
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: 08 out. 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 out. 08 ] 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 out. 08 ] Available from: https://doi.org/10.1016/j.ijar.2016.10.008
Trabalho de evento
The descriptive complexity of bayesian network specifications (2017)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Fonte: Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Nome do evento: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty - ECSQARU 2017. Unidades: IME, EP
Assuntos: 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 descriptive complexity of bayesian network specifications. 2017, Anais.. Cham: Springer, 2017. Disponível em: https://doi.org/10.1007/978-3-319-61581-3_9. Acesso em: 08 out. 2025.
APA
Cozman, F. G., & Mauá, D. D. (2017). The descriptive complexity of bayesian network specifications. In Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Cham: Springer. doi:10.1007/978-3-319-61581-3_9
NLM
Cozman FG, Mauá DD. The descriptive complexity of bayesian network specifications [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_9
Vancouver
Cozman FG, Mauá DD. The descriptive complexity of bayesian network specifications [Internet]. Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_9
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
Fonte: Proceedings. Nome do evento: International Conference on Scalable Uncertainty Management - SUM. 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 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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-319-67582-4_9
Trabalho de evento
Parameter learning in ProbLog with probabilistic rules (2017)
Faria, Francisco Henrique Otte Vieira de ; Gusmão, Arthur C; De Bona, Glauber ; Mauá, Denis Deratani ; Cozman, Fabio Gagliardi
Fonte: Proceedings. Nome do evento: Symposium on Knowledge Discovery, Mining and Learning - KDMiLe. Unidades: IME, EP
Assuntos: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL, PROGRAMAÇÃO LÓGICA
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. Parameter learning in ProbLog with probabilistic rules. 2017, Anais.. Porto Alegre: SBC, 2017. Disponível em: http://www.facom.ufu.br/~kdmile/proceedings/anais-kdmile-2017.pdf. Acesso em: 08 out. 2025.
APA
Faria, F. H. O. V. de, Gusmão, A. C., De Bona, G., Mauá, D. D., & Cozman, F. G. (2017). Parameter learning in ProbLog with probabilistic rules. In Proceedings. Porto Alegre: SBC. Recuperado de http://www.facom.ufu.br/~kdmile/proceedings/anais-kdmile-2017.pdf
NLM
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Parameter learning in ProbLog with probabilistic rules [Internet]. Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: http://www.facom.ufu.br/~kdmile/proceedings/anais-kdmile-2017.pdf
Vancouver
Faria FHOV de, Gusmão AC, De Bona G, Mauá DD, Cozman FG. Parameter learning in ProbLog with probabilistic rules [Internet]. Proceedings. 2017 ;[citado 2025 out. 08 ] Available from: http://www.facom.ufu.br/~kdmile/proceedings/anais-kdmile-2017.pdf
Curadoria
Symposium on knowledge discovery, mining and learning, 5 (2017)
Carvalho, André Carlos Ponce de Leon Ferreira de (cur) ; Razente, Humberto Luiz (cur); Pereira, João Henrique de Souza (cur); Paiva, José Gustavo de Souza (cur); Martins, Luiz Gustavo Almeida (cur); Nascimento, Marcelo Zanchetta do (cur); Barioni, Maria Camila Nardini (cur); Escarpinati, Mauricio Cunha (cur); Carneiro, Murillo Guimarães (cur); Gabriel, Paulo Henrique Ribeiro (cur); Sousa, Elaine Parros Machado de (cur) ; Cozman, Fabio Gagliardi (cur) ; Liang, Zhao (cur); Nascimento, Mariá (cur); Tinós, Renato (cur); Rezende, Solange Oliveira (cur)
Unidades: ICMC, EP, FFCLRP
Assunto: APRENDIZADO COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
Symposium on knowledge discovery, mining and learning, 5. . Uberlândia: SBC. Disponível em: http://www.facom.ufu.br/~kdmile/committes/index.html. Acesso em: 08 out. 2025. , 2017
APA
Symposium on knowledge discovery, mining and learning, 5. (2017). Symposium on knowledge discovery, mining and learning, 5. Uberlândia: SBC. Recuperado de http://www.facom.ufu.br/~kdmile/committes/index.html
NLM
Symposium on knowledge discovery, mining and learning, 5 [Internet]. 2017 ;[citado 2025 out. 08 ] Available from: http://www.facom.ufu.br/~kdmile/committes/index.html
Vancouver
Symposium on knowledge discovery, mining and learning, 5 [Internet]. 2017 ;[citado 2025 out. 08 ] Available from: http://www.facom.ufu.br/~kdmile/committes/index.html
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
Fonte: PMLR: Proceedings of Machine Learning Research. Nome do evento: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: IME, EP
Assuntos: 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: 08 out. 2025. , 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 2025 out. 08 ] 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 2025 out. 08 ] Available from: http://proceedings.mlr.press/v62/bueno17a.html
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: 08 out. 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 out. 08 ] 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 out. 08 ] Available from: https://doi.org/10.1016/j.ijar.2017.03.014
Trabalho de evento
The complexity of inferences and explanations in probabilistic logic programming (2017)
Cozman, Fabio Gagliardi ; Mauá, Denis Deratani
Fonte: Symbolic and quantitative approaches to reasoning with bncertainty: Proceedings. Nome do evento: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty - ECSQARU 2017. Unidades: IME, EP
Assuntos: 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: 08 out. 2025.
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 2025 out. 08 ] 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 2025 out. 08 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_40

Unidades USP

ReP

Filtros

Autores

Autores USP

Assuntos

Título da fonte

Nome do evento