Menu

Filtros : "Credal sets" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Artigo de periodico

    Tractable inference in credal sentential decision diagrams (2020)

    Mattei, Lilith; Antonucci, Alessandro; Mauá, Denis Deratani ; Facchini, Alessandro ; Villanueva Llerena, Julissa Giuliana

    Source: International Journal of Approximate Reasoning. Unidade: IME

    Assunto: MODELOS PARA PROCESSOS ESTOCÁSTICOS

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

    • ABNT

      MATTEI, Lilith et al. Tractable inference in credal sentential decision diagrams. International Journal of Approximate Reasoning, v. 125, p. 26-48, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.06.005. Acesso em: 10 fev. 2026.

    • APA

      Mattei, L., Antonucci, A., Mauá, D. D., Facchini, A., & Villanueva Llerena, J. G. (2020). Tractable inference in credal sentential decision diagrams. International Journal of Approximate Reasoning, 125, 26-48. doi:10.1016/j.ijar.2020.06.005

    • NLM

      Mattei L, Antonucci A, Mauá DD, Facchini A, Villanueva Llerena JG. Tractable inference in credal sentential decision diagrams [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 26-48.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.ijar.2020.06.005

    • Vancouver

      Mattei L, Antonucci A, Mauá DD, Facchini A, Villanueva Llerena JG. Tractable inference in credal sentential decision diagrams [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 26-48.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.ijar.2020.06.005

  • Artigo de periodico

    The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (2020)

    Cozman, Fabio Gagliardi ; Mauá, Denis Deratani

    Source: International Journal of Approximate Reasoning. Unidades: EP, IME

    Subjects: PROGRAMAÇÃO LÓGICA, COMPUTABILIDADE E COMPLEXIDADE

    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 joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, v. 125, p. 218-239, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2020.07.004. Acesso em: 10 fev. 2026.

    • APA

      Cozman, F. G., & Mauá, D. D. (2020). The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. International Journal of Approximate Reasoning, 125, 218-239. doi:10.1016/j.ijar.2020.07.004

    • NLM

      Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004

    • Vancouver

      Cozman FG, Mauá DD. The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference [Internet]. International Journal of Approximate Reasoning. 2020 ; 125 218-239.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1016/j.ijar.2020.07.004
  • 1

1 - 2 (2 records)

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