Filtros : "PROBABILIDADE" "EP-PMR" Removidos: "Saúde na Comunidade" "Universidade Federal do Ceará (UFC)" Limpar

Filtros



Refine with date range


  • Source: Journal of Artificial Intelligence Research. Unidades: EP, IME

    Subjects: PROGRAMAÇÃO LÓGICA, PROBABILIDADE

    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. 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: 16 nov. 2024.
    • 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 2024 nov. 16 ] 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 2024 nov. 16 ] Available from: https://doi.org/10.1613/jair.5482
  • Source: International Journal of Approximate Reasoning. Unidades: EP, IME

    Subjects: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, TEORIA DOS GRAFOS, LÓGICA MATEMÁTICA, PROBABILIDADE, PROCESSOS ESTOCÁSTICOS

    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. 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: 16 nov. 2024.
    • 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 2024 nov. 16 ] 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 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.ijar.2016.10.008
  • Source: Journal of Machine Learning Research. Conference titles: International Conference on Probabilistic Graphical Models - PMLR. Unidades: EP, IME

    Subjects: LÓGICA MATEMÁTICA, PROBABILIDADE

    PrivadoAcesso à fonteHow 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. 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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] Available from: http://proceedings.mlr.press/v52/cozman16.pdf
  • Source: Proceedings. Conference titles: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: EP, IME

    Subjects: PROBABILIDADE, COMPUTABILIDADE E COMPLEXIDADE, INTELIGÊNCIA ARTIFICIAL

    PrivadoAcesso à fonteHow 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. 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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] Available from: http://sipta.org/isipta15/data/paper/1.pdf
  • Source: Journal of Applied Logic. Unidades: EP, IME

    Subjects: INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO PROBABILÍSTICO, PROBABILIDADE

    PrivadoAcesso à fonteDOIHow to cite
    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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] Available from: https://doi.org/10.1016/j.jal.2014.01.005
  • 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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] Available from: http://ceur-ws.org/Vol-1259/ursw2014_submission_7.pdf
  • Source: International Journal of Approximate Reasoning. Unidade: EP

    Subjects: PROBABILIDADE, INFERÊNCIA BAYESIANA, INTELIGÊNCIA ARTIFICIAL

    PrivadoAcesso à fonteAcesso à fonteDOIHow to cite
    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: 16 nov. 2024.
    • 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 2024 nov. 16 ] 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 2024 nov. 16 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X14000772#
  • Source: International Journal of Approximate Reasoning. Unidade: EP

    Subjects: PROBABILIDADE, INFERÊNCIA, TEORIA DOS GRAFOS

    PrivadoAcesso à fonteAcesso à fonteDOIHow 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. 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: 16 nov. 2024.
    • 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 2024 nov. 16 ] 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 2024 nov. 16 ] Available from: http://www.sciencedirect.com/science/article/pii/S0888613X1300203X
  • Source: Journal of the Brazilian Computer Society. Unidade: EP

    Subjects: PROBABILIDADE, LÓGICA, ALGORITMOS

    PrivadoAcesso à fonteAcesso à fonteDOIHow 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. Link prediction using a probabilistic description logic. Journal of the Brazilian Computer Society, v. 19, p. 397-409, 2013Tradução . . Disponível em: http://link.springer.com/article/10.1007/s13173-013-0108-8#page-1. Acesso em: 16 nov. 2024.
    • APA

      Luna, J. E. O., Revoredo, K., & Cozman, F. G. (2013). Link prediction using a probabilistic description logic. Journal of the Brazilian Computer Society, 19, 397-409. doi:10.1007/s13173-013-0108-8
    • NLM

      Luna JEO, Revoredo K, Cozman FG. Link prediction using a probabilistic description logic [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 397-409.[citado 2024 nov. 16 ] Available from: http://link.springer.com/article/10.1007/s13173-013-0108-8#page-1
    • Vancouver

      Luna JEO, Revoredo K, Cozman FG. Link prediction using a probabilistic description logic [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19 397-409.[citado 2024 nov. 16 ] Available from: http://link.springer.com/article/10.1007/s13173-013-0108-8#page-1
  • Source: Proceedings. Conference titles: Seminar on Ontology Research in Brazil - ONTOBRAS. Unidade: EP

    Subjects: ALGORITMOS, ONTOLOGIAS, PROBABILIDADE, WEB SEMÂNTICA

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

      ARMADA, Marcius et al. Assertion role in a hybrid link prediction approach through probabilistic ontology. 2013, Anais.. Belo Horizonte: ECI/UFMG, 2013. Disponível em: http://ceur-ws.org/Vol-1041/ontobras-2013_paper33.pdf. Acesso em: 16 nov. 2024.
    • APA

      Armada, M., Revoredo, K., Luna, J. E. O., & Cozman, F. G. (2013). Assertion role in a hybrid link prediction approach through probabilistic ontology. In Proceedings. Belo Horizonte: ECI/UFMG. Recuperado de http://ceur-ws.org/Vol-1041/ontobras-2013_paper33.pdf
    • NLM

      Armada M, Revoredo K, Luna JEO, Cozman FG. Assertion role in a hybrid link prediction approach through probabilistic ontology [Internet]. Proceedings. 2013 ;[citado 2024 nov. 16 ] Available from: http://ceur-ws.org/Vol-1041/ontobras-2013_paper33.pdf
    • Vancouver

      Armada M, Revoredo K, Luna JEO, Cozman FG. Assertion role in a hybrid link prediction approach through probabilistic ontology [Internet]. Proceedings. 2013 ;[citado 2024 nov. 16 ] Available from: http://ceur-ws.org/Vol-1041/ontobras-2013_paper33.pdf
  • Source: ISIPTA '13 : proceedings. Conference titles: International Symposium on Imprecise Probability: Theories and Applications. Unidade: EP

    Subjects: PROBABILIDADE, TEORIA DOS GRAFOS, INTELIGÊNCIA ARTIFICIAL

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

      COZMAN, Fabio Gagliardi. Independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles. 2013, Anais.. [S.l.]: SIPTA, 2013. Disponível em: http://www.sipta.org/isipta13/proceedings/papers/s009.pdf. Acesso em: 16 nov. 2024.
    • APA

      Cozman, F. G. (2013). Independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles. In ISIPTA '13 : proceedings. [S.l.]: SIPTA. Recuperado de http://www.sipta.org/isipta13/proceedings/papers/s009.pdf
    • NLM

      Cozman FG. Independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles [Internet]. ISIPTA '13 : proceedings. 2013 ;[citado 2024 nov. 16 ] Available from: http://www.sipta.org/isipta13/proceedings/papers/s009.pdf
    • Vancouver

      Cozman FG. Independence for sets of full conditional probabilities, sets of lexicographic probabilities, and sets of desirable gambles [Internet]. ISIPTA '13 : proceedings. 2013 ;[citado 2024 nov. 16 ] Available from: http://www.sipta.org/isipta13/proceedings/papers/s009.pdf
  • Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: EP

    Subjects: PROBABILIDADE, ALGORITMOS PARA IMAGENS

    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. A scalable probabilistic description logic approach for semantic link prediction. 2012, Anais.. Porto Alegre: SBC, 2012. Disponível em: http://sites.poli.usp.br/p/fabio.cozman/Publications/Article/luna-revoredo-cozman-enia2012F.pdf. Acesso em: 16 nov. 2024.
    • APA

      Luna, J. E. O., Revoredo, K., & Cozman, F. G. (2012). A scalable probabilistic description logic approach for semantic link prediction. In Proceedings. Porto Alegre: SBC. Recuperado de http://sites.poli.usp.br/p/fabio.cozman/Publications/Article/luna-revoredo-cozman-enia2012F.pdf
    • NLM

      Luna JEO, Revoredo K, Cozman FG. A scalable probabilistic description logic approach for semantic link prediction [Internet]. Proceedings. 2012 ;[citado 2024 nov. 16 ] Available from: http://sites.poli.usp.br/p/fabio.cozman/Publications/Article/luna-revoredo-cozman-enia2012F.pdf
    • Vancouver

      Luna JEO, Revoredo K, Cozman FG. A scalable probabilistic description logic approach for semantic link prediction [Internet]. Proceedings. 2012 ;[citado 2024 nov. 16 ] Available from: http://sites.poli.usp.br/p/fabio.cozman/Publications/Article/luna-revoredo-cozman-enia2012F.pdf
  • Source: Synthese. Unidade: EP

    Subjects: PROBABILIDADE, INFERÊNCIA BAYESIANA

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

      COZMAN, Fabio Gagliardi. Sets of probability distributions, independence, and convexity. Synthese, v. 186, n. 2, p. 577-600, 2012Tradução . . Disponível em: https://doi.org/10.1007/s11229-011-9999-0. Acesso em: 16 nov. 2024.
    • APA

      Cozman, F. G. (2012). Sets of probability distributions, independence, and convexity. Synthese, 186( 2), 577-600. doi:10.1007/s11229-011-9999-0
    • NLM

      Cozman FG. Sets of probability distributions, independence, and convexity [Internet]. Synthese. 2012 ; 186( 2): 577-600.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/s11229-011-9999-0
    • Vancouver

      Cozman FG. Sets of probability distributions, independence, and convexity [Internet]. Synthese. 2012 ; 186( 2): 577-600.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1007/s11229-011-9999-0
  • 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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] 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: 16 nov. 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 nov. 16 ] 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 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/34f4fdab-f63d-42c3-8817-e7d698867017/Cozman-2011-Semantic%20link%20prediction%20through%20probabilistic%20ok.pdf
  • Source: International Journal of Approximate Reasoning. Unidade: EP

    Assunto: PROBABILIDADE

    PrivadoAcesso à fonteAcesso à fonteDOIHow to cite
    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: 16 nov. 2024.
    • 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 2024 nov. 16 ] 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 2024 nov. 16 ] Available from: http://ac.els-cdn.com/S0888613X10001040/1-s2.0-S0888613X10001040-main.pdf?_tid=1e24c122-9259-11e2-a60c-00000aab0f26&acdnat=1363892403_9fce150d8810cd456df1cf4f4abcb38d
  • Source: Proceedings. Conference titles: International Symposium on Imprecise Probability: Theories and Applications - ISIPTA. Unidades: IME, EP

    Subjects: PROCESSOS DE MARKOV, PROBABILIDADE, REPRESENTAÇÃO DE CONHECIMENTO, PROGRAMAÇÃO LINEAR

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

      DELGADO, Karina Valdivia et al. Representing and solving factored Markov decision processes with imprecise probabilities. 2009, Anais.. Durham: SIPTA, 2009. Disponível em: https://www.sipta.org/isipta09/proceedings/isipta09-proceedings.pdf. Acesso em: 16 nov. 2024.
    • APA

      Delgado, K. V., Barros, L. N. de, Cozman, F. G., & Shirota, R. (2009). Representing and solving factored Markov decision processes with imprecise probabilities. In Proceedings. Durham: SIPTA. Recuperado de https://www.sipta.org/isipta09/proceedings/isipta09-proceedings.pdf
    • NLM

      Delgado KV, Barros LN de, Cozman FG, Shirota R. Representing and solving factored Markov decision processes with imprecise probabilities [Internet]. Proceedings. 2009 ;[citado 2024 nov. 16 ] Available from: https://www.sipta.org/isipta09/proceedings/isipta09-proceedings.pdf
    • Vancouver

      Delgado KV, Barros LN de, Cozman FG, Shirota R. Representing and solving factored Markov decision processes with imprecise probabilities [Internet]. Proceedings. 2009 ;[citado 2024 nov. 16 ] Available from: https://www.sipta.org/isipta09/proceedings/isipta09-proceedings.pdf
  • Source: Journal of Applied Logic. Unidade: EP

    Subjects: PROBABILIDADE, PROGRAMAÇÃO LINEAR

    PrivadoAcesso à fonteAcesso à fonteDOIHow to cite
    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 e LUNA, José Eduardo Ochoa. Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence. Journal of Applied Logic, v. 7, p. 137-154, 2009Tradução . . Disponível em: https://doi.org/10.1016/j.jal.2007.11.002. Acesso em: 16 nov. 2024.
    • APA

      Campos, C. P. de, Cozman, F. G., & Luna, J. E. O. (2009). Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence. Journal of Applied Logic, 7, 137-154. doi:10.1016/j.jal.2007.11.002
    • NLM

      Campos CP de, Cozman FG, Luna JEO. Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence [Internet]. Journal of Applied Logic. 2009 ; 7 137-154.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.jal.2007.11.002
    • Vancouver

      Campos CP de, Cozman FG, Luna JEO. Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence [Internet]. Journal of Applied Logic. 2009 ; 7 137-154.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1016/j.jal.2007.11.002
  • Source: Journal of Applied Logic. Unidade: EP

    Subjects: PROBABILIDADE, REDES NEURAIS

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

      COZMAN, Fabio Gagliardi et al. Combining probability and logic. Journal of Applied Logic, v. 7, p. 131-135, 2009Tradução . . Disponível em: https://repositorio.usp.br/directbitstream/1f2d4285-5458-4904-9a0c-8abceaf3e59a/Cozman-2009-combining%20probability%20and%20logic.pdf. Acesso em: 16 nov. 2024.
    • APA

      Cozman, F. G., Haenni, R., Rmeijn, J. -W., Russo, F., Wheeler, G., & Williamson, J. (2009). Combining probability and logic. Journal of Applied Logic, 7, 131-135. Recuperado de https://repositorio.usp.br/directbitstream/1f2d4285-5458-4904-9a0c-8abceaf3e59a/Cozman-2009-combining%20probability%20and%20logic.pdf
    • NLM

      Cozman FG, Haenni R, Rmeijn J-W, Russo F, Wheeler G, Williamson J. Combining probability and logic [Internet]. Journal of Applied Logic. 2009 ; 7 131-135.[citado 2024 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/1f2d4285-5458-4904-9a0c-8abceaf3e59a/Cozman-2009-combining%20probability%20and%20logic.pdf
    • Vancouver

      Cozman FG, Haenni R, Rmeijn J-W, Russo F, Wheeler G, Williamson J. Combining probability and logic [Internet]. Journal of Applied Logic. 2009 ; 7 131-135.[citado 2024 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/1f2d4285-5458-4904-9a0c-8abceaf3e59a/Cozman-2009-combining%20probability%20and%20logic.pdf
  • Source: Lecture Notes in Artificial Intelligence. Conference titles: International Conference on Scalable Uncertainty Management. Unidade: EP

    Subjects: INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE, ALGORITMOS, INFERÊNCIA

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

      COZMAN, Fabio Gagliardi e POLASTRO, Rodrigo Bellizia. Loopy propagation in a probabilistic description logic. Lecture Notes in Artificial Intelligence. Heidelberg: Springer-Verlag. Disponível em: https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf. Acesso em: 16 nov. 2024. , 2008
    • APA

      Cozman, F. G., & Polastro, R. B. (2008). Loopy propagation in a probabilistic description logic. Lecture Notes in Artificial Intelligence. Heidelberg: Springer-Verlag. Recuperado de https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf
    • NLM

      Cozman FG, Polastro RB. Loopy propagation in a probabilistic description logic [Internet]. Lecture Notes in Artificial Intelligence. 2008 ; 5291 120-133.[citado 2024 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf
    • Vancouver

      Cozman FG, Polastro RB. Loopy propagation in a probabilistic description logic [Internet]. Lecture Notes in Artificial Intelligence. 2008 ; 5291 120-133.[citado 2024 nov. 16 ] Available from: https://repositorio.usp.br/directbitstream/6554d3ed-c009-4928-83bd-06378d17ffe0/Cozman-2008-Loopy%20Propagation%20in%20a%20Probabilistic%20Description.pdf

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