Filtros : "Cozman, Fabio Gagliardi" "Springer" Removidos: "Indexado no PubMed" "FERREIRA JÚNIOR, JOSÉ RIBAMAR DOS SANTOS" "Mugnaini, Rogério" "SILVA, MAÍRA MARTINS DA" Limpar

Filtros



Refine with date range


  • Unidades: IME, EP, IEA

    Subjects: INTELIGÊNCIA ARTIFICIAL, PROCESSAMENTO DE LINGUAGEM NATURAL, ARGUMENTAÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ROCHA, Victor Hugo Nascimento et al. Assessing good, bad and ugly arguments generated by ChatGPT: a new dataset, its methodology and associated tasks. 2023, Anais.. Cham: Springer, 2023. Disponível em: https://doi.org/10.1007/978-3-031-49008-8_34. Acesso em: 26 maio 2024.
    • APA

      Rocha, V. H. N., Silveira, I. C., Pirozelli, P., Mauá, D. D., & Cozman, F. G. (2023). Assessing good, bad and ugly arguments generated by ChatGPT: a new dataset, its methodology and associated tasks. In . Cham: Springer. doi:10.1007/978-3-031-49008-8_34
    • NLM

      Rocha VHN, Silveira IC, Pirozelli P, Mauá DD, Cozman FG. Assessing good, bad and ugly arguments generated by ChatGPT: a new dataset, its methodology and associated tasks [Internet]. 2023 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-031-49008-8_34
    • Vancouver

      Rocha VHN, Silveira IC, Pirozelli P, Mauá DD, Cozman FG. Assessing good, bad and ugly arguments generated by ChatGPT: a new dataset, its methodology and associated tasks [Internet]. 2023 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-031-49008-8_34
  • Source: Proceedings. Conference titles: International Conference on Computational Processing of the Portuguese Language - PROPOR. Unidades: IME, EP

    Subjects: PROCESSAMENTO DE LINGUAGEM NATURAL, APRENDIZADO COMPUTACIONAL

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      JOSÉ, Marcos Menon et al. Integrating question answering and text-to-SQL in portuguese. 2022, Anais.. Cham: Springer, 2022. Disponível em: https://doi.org/10.1007/978-3-030-98305-5_26. Acesso em: 26 maio 2024.
    • APA

      José, M. M., José, M. A., Mauá, D. D., & Cozman, F. G. (2022). Integrating question answering and text-to-SQL in portuguese. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-98305-5_26
    • NLM

      José MM, José MA, Mauá DD, Cozman FG. Integrating question answering and text-to-SQL in portuguese [Internet]. Proceedings. 2022 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-030-98305-5_26
    • Vancouver

      José MM, José MA, Mauá DD, Cozman FG. Integrating question answering and text-to-SQL in portuguese [Internet]. Proceedings. 2022 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-030-98305-5_26
  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 26 maio 2024.
    • 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 2024 maio 26 ] 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 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_9
  • Source: Proceedings. Conference titles: International Conference on Scalable Uncertainty Management - SUM. Unidades: EP, IME

    Subjects: PROGRAMAÇÃO LÓGICA, APRENDIZADO COMPUTACIONAL

    PrivadoAcesso à fonteDOIHow to cite
    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: 26 maio 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 maio 26 ] 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 maio 26 ] Available from: https://doi.org/10.1007/978-3-319-67582-4_9
  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 26 maio 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 maio 26 ] 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 maio 26 ] Available from: https://doi.org/10.1007/978-3-319-61581-3_40
  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 26 maio 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 maio 26 ] 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 maio 26 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_4
  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 26 maio 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 maio 26 ] 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 maio 26 ] Available from: https://doi.org/10.1007/978-3-319-23540-0_3
  • Source: Proceedings: ISWC. Conference titles: International Workshop on Uncertainty Reasoning for the Semantic Web. Unidade: EP

    Subjects: REDES NEURAIS, ROBÓTICA, PROBABILIDADE

    PrivadoAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      TORO, Walter Mayor et al. Probabilistic relational reasoning in semantic robot navigation. 2014, Anais.. Cham: Springer, 2014. Disponível em: http://ceur-ws.org/Vol-1259/ursw2014_submission_7.pdf. Acesso em: 26 maio 2024.
    • APA

      Toro, W. M., Cozman, F. G., Revoredo, K., & Reali Costa, A. H. (2014). Probabilistic relational reasoning in semantic robot navigation. In Proceedings: ISWC. Cham: Springer. Recuperado de http://ceur-ws.org/Vol-1259/ursw2014_submission_7.pdf
    • NLM

      Toro WM, Cozman FG, Revoredo K, Reali Costa AH. Probabilistic relational reasoning in semantic robot navigation [Internet]. Proceedings: ISWC. 2014 ;[citado 2024 maio 26 ] Available from: http://ceur-ws.org/Vol-1259/ursw2014_submission_7.pdf
    • Vancouver

      Toro WM, Cozman FG, Revoredo K, Reali Costa AH. Probabilistic relational reasoning in semantic robot navigation [Internet]. Proceedings: ISWC. 2014 ;[citado 2024 maio 26 ] Available from: http://ceur-ws.org/Vol-1259/ursw2014_submission_7.pdf
  • Conference titles: RoboCup International Symposium. Unidades: EP, EACH

    Subjects: INTELIGÊNCIA ARTIFICIAL, ROBÓTICA, APRENDIZADO COMPUTACIONAL

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SILVA, Valdinei Freire da et al. Reusing risk-aware stochastic abstract policies in robotic navigation learning. 2014, Anais.. Berlin: Springer, 2014. Disponível em: https://repositorio.usp.br/directbitstream/5d87c375-54fa-41a7-aedb-8375552526dc/Cozman-2014-Reusing%20risk-aware%20stochastic%20abstract%20policies%20in%20robotic%20navigation%20learning.pdf. Acesso em: 26 maio 2024.
    • APA

      Silva, V. F. da, Koga, M. L., Cozman, F. G., & Reali Costa, A. H. (2014). Reusing risk-aware stochastic abstract policies in robotic navigation learning. In . Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/5d87c375-54fa-41a7-aedb-8375552526dc/Cozman-2014-Reusing%20risk-aware%20stochastic%20abstract%20policies%20in%20robotic%20navigation%20learning.pdf
    • NLM

      Silva VF da, Koga ML, Cozman FG, Reali Costa AH. Reusing risk-aware stochastic abstract policies in robotic navigation learning [Internet]. 2014 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/5d87c375-54fa-41a7-aedb-8375552526dc/Cozman-2014-Reusing%20risk-aware%20stochastic%20abstract%20policies%20in%20robotic%20navigation%20learning.pdf
    • Vancouver

      Silva VF da, Koga ML, Cozman FG, Reali Costa AH. Reusing risk-aware stochastic abstract policies in robotic navigation learning [Internet]. 2014 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/5d87c375-54fa-41a7-aedb-8375552526dc/Cozman-2014-Reusing%20risk-aware%20stochastic%20abstract%20policies%20in%20robotic%20navigation%20learning.pdf
  • Source: Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. Conference titles: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Unidade: EP

    Subjects: PROBABILIDADE E ESTATISTICA, INTELIGÊNCIA ARTIFICIAL, ROBÔS

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PEREIRA, Valquiria Fenelon et al. A Qualitative-probabilistic approach to autonomous mobile robot self localisation and self vision calibration. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://repositorio.usp.br/directbitstream/d6f0cad1-362d-456d-b677-ce4dfa13efdb/Cozman-2013-A%20Qualitative-probabilistic%20approach%20to%20autonomous%20mobile%20robot%20self%20localisation.pdf. Acesso em: 26 maio 2024.
    • APA

      Pereira, V. F., Cozman, F. G., Santos, P. E., & Martins, M. F. (2013). A Qualitative-probabilistic approach to autonomous mobile robot self localisation and self vision calibration. In Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/d6f0cad1-362d-456d-b677-ce4dfa13efdb/Cozman-2013-A%20Qualitative-probabilistic%20approach%20to%20autonomous%20mobile%20robot%20self%20localisation.pdf
    • NLM

      Pereira VF, Cozman FG, Santos PE, Martins MF. A Qualitative-probabilistic approach to autonomous mobile robot self localisation and self vision calibration [Internet]. Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. 2013 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/d6f0cad1-362d-456d-b677-ce4dfa13efdb/Cozman-2013-A%20Qualitative-probabilistic%20approach%20to%20autonomous%20mobile%20robot%20self%20localisation.pdf
    • Vancouver

      Pereira VF, Cozman FG, Santos PE, Martins MF. A Qualitative-probabilistic approach to autonomous mobile robot self localisation and self vision calibration [Internet]. Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. 2013 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/d6f0cad1-362d-456d-b677-ce4dfa13efdb/Cozman-2013-A%20Qualitative-probabilistic%20approach%20to%20autonomous%20mobile%20robot%20self%20localisation.pdf
  • Source: Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. Conference titles: European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty. Unidade: EP

    Subjects: PROBABILIDADE E ESTATISTICA, INTELIGÊNCIA ARTIFICIAL

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      COZMAN, Fabio Gagliardi e IANNI, Lucas Fargoni di. Probabilistic satisfiability and coherence checking through Integer programming. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://repositorio.usp.br/directbitstream/1a2e1c5e-cabd-4499-ad2a-0e876235f7bf/Cozman-2013-Probabilistic%20satisfiability%20and%20coherence%20checking%20through%20Integer%20programming.pdf. Acesso em: 26 maio 2024.
    • APA

      Cozman, F. G., & Ianni, L. F. di. (2013). Probabilistic satisfiability and coherence checking through Integer programming. In Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/1a2e1c5e-cabd-4499-ad2a-0e876235f7bf/Cozman-2013-Probabilistic%20satisfiability%20and%20coherence%20checking%20through%20Integer%20programming.pdf
    • NLM

      Cozman FG, Ianni LF di. Probabilistic satisfiability and coherence checking through Integer programming [Internet]. Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. 2013 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/1a2e1c5e-cabd-4499-ad2a-0e876235f7bf/Cozman-2013-Probabilistic%20satisfiability%20and%20coherence%20checking%20through%20Integer%20programming.pdf
    • Vancouver

      Cozman FG, Ianni LF di. Probabilistic satisfiability and coherence checking through Integer programming [Internet]. Symbolic and quantitative approaches to reasoning and uncertainty: ECSQARU'2013: proceedings. 2013 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/1a2e1c5e-cabd-4499-ad2a-0e876235f7bf/Cozman-2013-Probabilistic%20satisfiability%20and%20coherence%20checking%20through%20Integer%20programming.pdf
  • Source: Proceedings: ISWC. Conference titles: International Workshop on Uncertainty Reasoning for the Semantic Web. Unidade: EP

    Subjects: WEB SEMÂNTICA, INFERÊNCIA, TEORIA DOS GRAFOS

    PrivadoAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LUNA, José Eduardo Ochoa e REVOREDO, Kate e COZMAN, Fabio Gagliardi. An Experimental evaluation of a scalable probabilistic description logic approach for semantic link prediction. 2012, Anais.. New York: Springer, 2012. Disponível em: http://ceur-ws.org/Vol-900/paper6.pdf. Acesso em: 26 maio 2024.
    • APA

      Luna, J. E. O., Revoredo, K., & Cozman, F. G. (2012). An Experimental evaluation of a scalable probabilistic description logic approach for semantic link prediction. In Proceedings: ISWC. New York: Springer. Recuperado de http://ceur-ws.org/Vol-900/paper6.pdf
    • NLM

      Luna JEO, Revoredo K, Cozman FG. An Experimental evaluation of a scalable probabilistic description logic approach for semantic link prediction [Internet]. Proceedings: ISWC. 2012 ;[citado 2024 maio 26 ] Available from: http://ceur-ws.org/Vol-900/paper6.pdf
    • Vancouver

      Luna JEO, Revoredo K, Cozman FG. An Experimental evaluation of a scalable probabilistic description logic approach for semantic link prediction [Internet]. Proceedings: ISWC. 2012 ;[citado 2024 maio 26 ] Available from: http://ceur-ws.org/Vol-900/paper6.pdf
  • Source: Proceedings: ISWC. Conference titles: International Workshop on Uncertainty Reasoning for the Semantic Web. Unidade: EP

    Subjects: INFERÊNCIA, PROBABILIDADE, ONTOLOGIAS

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      POLASTRO, Rodrigo Bellizia et al. Computing inferences for credal ALC terminologies. 2012, Anais.. New York: Springer, 2012. Disponível em: https://repositorio.usp.br/directbitstream/2d891135-eb5a-4a26-9863-23804ec7a13d/Cozman-2012-Computing%20inferences%20for%20credal%20ALC%20Terminologies%20ok.pdf. Acesso em: 26 maio 2024.
    • APA

      Polastro, R. B., Cozman, F. G., Takiyama, F. I., & Revoredo, K. (2012). Computing inferences for credal ALC terminologies. In Proceedings: ISWC. New York: Springer. Recuperado de https://repositorio.usp.br/directbitstream/2d891135-eb5a-4a26-9863-23804ec7a13d/Cozman-2012-Computing%20inferences%20for%20credal%20ALC%20Terminologies%20ok.pdf
    • NLM

      Polastro RB, Cozman FG, Takiyama FI, Revoredo K. Computing inferences for credal ALC terminologies [Internet]. Proceedings: ISWC. 2012 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/2d891135-eb5a-4a26-9863-23804ec7a13d/Cozman-2012-Computing%20inferences%20for%20credal%20ALC%20Terminologies%20ok.pdf
    • Vancouver

      Polastro RB, Cozman FG, Takiyama FI, Revoredo K. Computing inferences for credal ALC terminologies [Internet]. Proceedings: ISWC. 2012 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/2d891135-eb5a-4a26-9863-23804ec7a13d/Cozman-2012-Computing%20inferences%20for%20credal%20ALC%20Terminologies%20ok.pdf
  • Source: Proceedings: ISWC. Conference titles: International Workshop on Uncertainty Reasoning for the Semantic Web. Unidade: EP

    Subjects: REDES NEURAIS, ROBÓTICA, PROBABILIDADE

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      REVOREDO, Kate e LUNA, José Eduardo Ochoa e COZMAN, Fabio Gagliardi. Semantic link prediction through probabilistic description logics. 2011, Anais.. Heidelberg: Springer, 2011. Disponível em: https://repositorio.usp.br/directbitstream/34f4fdab-f63d-42c3-8817-e7d698867017/Cozman-2011-Semantic%20link%20prediction%20through%20probabilistic%20ok.pdf. Acesso em: 26 maio 2024.
    • APA

      Revoredo, K., Luna, J. E. O., & Cozman, F. G. (2011). Semantic link prediction through probabilistic description logics. In Proceedings: ISWC. Heidelberg: Springer. Recuperado de https://repositorio.usp.br/directbitstream/34f4fdab-f63d-42c3-8817-e7d698867017/Cozman-2011-Semantic%20link%20prediction%20through%20probabilistic%20ok.pdf
    • NLM

      Revoredo K, Luna JEO, Cozman FG. Semantic link prediction through probabilistic description logics [Internet]. Proceedings: ISWC. 2011 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/34f4fdab-f63d-42c3-8817-e7d698867017/Cozman-2011-Semantic%20link%20prediction%20through%20probabilistic%20ok.pdf
    • Vancouver

      Revoredo K, Luna JEO, Cozman FG. Semantic link prediction through probabilistic description logics [Internet]. Proceedings: ISWC. 2011 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/34f4fdab-f63d-42c3-8817-e7d698867017/Cozman-2011-Semantic%20link%20prediction%20through%20probabilistic%20ok.pdf
  • Source: Proceedings. Conference titles: Mexican International Conference on Artificial Intelligence - MICAI. Unidades: IME, EP

    Subjects: PROCESSOS DE MARKOV, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PEREIRA, Silvio do Lago e BARROS, Leliane Nunes de e COZMAN, Fabio Gagliardi. Strong probabilistic planning. 2008, Anais.. Berlin: Springer, 2008. Disponível em: https://doi.org/10.1007/978-3-540-88636-5_61. Acesso em: 26 maio 2024.
    • APA

      Pereira, S. do L., Barros, L. N. de, & Cozman, F. G. (2008). Strong probabilistic planning. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-88636-5_61
    • NLM

      Pereira S do L, Barros LN de, Cozman FG. Strong probabilistic planning [Internet]. Proceedings. 2008 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-540-88636-5_61
    • Vancouver

      Pereira S do L, Barros LN de, Cozman FG. Strong probabilistic planning [Internet]. Proceedings. 2008 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/978-3-540-88636-5_61
  • Source: Proceedings. Conference titles: Ibero-American Conference on Artificial Intelligence - IBERAMIA. Unidades: EP, IME

    Subjects: PROBABILIDADE, INTELIGÊNCIA ARTIFICIAL

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      TREVIZAN, Felipe Werndl e COZMAN, Fabio Gagliardi e BARROS, Leliane Nunes de. Unifying nondeterministic and probabilistic planning through imprecise Markov decision processes. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://doi.org/10.1007/11874850_54. Acesso em: 26 maio 2024.
    • APA

      Trevizan, F. W., Cozman, F. G., & Barros, L. N. de. (2006). Unifying nondeterministic and probabilistic planning through imprecise Markov decision processes. In Proceedings. Berlin: Springer. doi:10.1007/11874850_54
    • NLM

      Trevizan FW, Cozman FG, Barros LN de. Unifying nondeterministic and probabilistic planning through imprecise Markov decision processes [Internet]. Proceedings. 2006 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/11874850_54
    • Vancouver

      Trevizan FW, Cozman FG, Barros LN de. Unifying nondeterministic and probabilistic planning through imprecise Markov decision processes [Internet]. Proceedings. 2006 ;[citado 2024 maio 26 ] Available from: https://doi.org/10.1007/11874850_54
  • Source: ECML/PKDD: proceedings. Conference titles: European Conference on Machine Learning. Unidade: EP

    Subjects: INTELIGÊNCIA ARTIFICIAL, ANÁLISE DE RISCO, APRENDIZADO COMPUTACIONAL

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      COLLA, Ernesto Coutinho e IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Bayesian network classifiers for country risk forecasting. 2006, Anais.. Berlin: Springer, 2006. Disponível em: https://repositorio.usp.br/directbitstream/f87779f2-ceed-4e15-8152-5d8210369e65/Cozman-2006-Bayesian%20network%20classifiers%20for%20country%20risk%20forecasting.pdf. Acesso em: 26 maio 2024.
    • APA

      Colla, E. C., Ide, J. S., & Cozman, F. G. (2006). Bayesian network classifiers for country risk forecasting. In ECML/PKDD: proceedings. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/f87779f2-ceed-4e15-8152-5d8210369e65/Cozman-2006-Bayesian%20network%20classifiers%20for%20country%20risk%20forecasting.pdf
    • NLM

      Colla EC, Ide JS, Cozman FG. Bayesian network classifiers for country risk forecasting [Internet]. ECML/PKDD: proceedings. 2006 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/f87779f2-ceed-4e15-8152-5d8210369e65/Cozman-2006-Bayesian%20network%20classifiers%20for%20country%20risk%20forecasting.pdf
    • Vancouver

      Colla EC, Ide JS, Cozman FG. Bayesian network classifiers for country risk forecasting [Internet]. ECML/PKDD: proceedings. 2006 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/f87779f2-ceed-4e15-8152-5d8210369e65/Cozman-2006-Bayesian%20network%20classifiers%20for%20country%20risk%20forecasting.pdf
  • Source: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Unidade: EP

    Subjects: PROBABILIDADE, INTELIGÊNCIA ARTIFICIAL

    PrivadoHow to cite
    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 strong independence. Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Tradução . Berlin: Springer, 2006. . Disponível em: https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf. Acesso em: 26 maio 2024.
    • APA

      Cozman, F. G., Campos, C. P. de, & Rocha, J. C. F. da. (2006). Probabilistic logic with strong independence. In Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf
    • NLM

      Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with strong independence [Internet]. In: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Berlin: Springer; 2006. [citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf
    • Vancouver

      Cozman FG, Campos CP de, Rocha JCF da. Probabilistic logic with strong independence [Internet]. In: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006. Berlin: Springer; 2006. [citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/ec8bcfe3-1112-430c-a1a3-7fa0251b8f1f/Cozman-2006-Probabilistic%20Logic%20with%20Strong%20Independence.pdf
  • Source: SBIA 2002. Conference titles: Brazilian Symposium on Artificial Intelligence. Unidade: EP

    Subjects: REDES DE COMPUTADORES, ALGORITMOS, INTELIGÊNCIA ARTIFICIAL

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Testing MCMC algorithms with randomly generated bayesian networks. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf. Acesso em: 26 maio 2024.
    • APA

      Ide, J. S., & Cozman, F. G. (2002). Testing MCMC algorithms with randomly generated bayesian networks. In SBIA 2002. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf
    • NLM

      Ide JS, Cozman FG. Testing MCMC algorithms with randomly generated bayesian networks [Internet]. SBIA 2002. 2002 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf
    • Vancouver

      Ide JS, Cozman FG. Testing MCMC algorithms with randomly generated bayesian networks [Internet]. SBIA 2002. 2002 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/7b90d0a4-4a74-4810-a1d4-a7a2be324e02/Cozman-2002-Testing%20MCMC%20algorithms%20with%20randomly.pdf
  • Source: SEBIA 2002. Conference titles: Brazilian Symposium on Artificial Intelligence. Unidade: EP

    Subjects: REDES DE COMPUTADORES, ALGORITMOS

    PrivadoHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      IDE, Jaime Shinsuke e COZMAN, Fabio Gagliardi. Randon generation of bayesian networks. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf. Acesso em: 26 maio 2024.
    • APA

      Ide, J. S., & Cozman, F. G. (2002). Randon generation of bayesian networks. In SEBIA 2002. Berlin: Springer. Recuperado de https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf
    • NLM

      Ide JS, Cozman FG. Randon generation of bayesian networks [Internet]. SEBIA 2002. 2002 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf
    • Vancouver

      Ide JS, Cozman FG. Randon generation of bayesian networks [Internet]. SEBIA 2002. 2002 ;[citado 2024 maio 26 ] Available from: https://repositorio.usp.br/directbitstream/6ec6db34-3f51-4298-9c11-b4033f226556/Cozman-2002-Randon%20generation%20of%20bayesian%20networks.pdf

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024