Filtros : "Journal of Artificial Intelligence Research" Limpar

Filtros



Refine with date range


  • Source: Journal of Artificial Intelligence Research. Unidade: EP

    Assunto: APRENDIZADO COMPUTACIONAL

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

      SILVA, Felipe Leno da e REALI COSTA, Anna Helena. A Survey on Transfer Learning for Multiagent Reinforcement Learning Systems. Journal of Artificial Intelligence Research, v. 64, p. 645-703, 2019Tradução . . Disponível em: https://doi.org/10.1613/jair.1.11396. Acesso em: 10 jun. 2024.
    • APA

      Silva, F. L. da, & Reali Costa, A. H. (2019). A Survey on Transfer Learning for Multiagent Reinforcement Learning Systems. Journal of Artificial Intelligence Research, 64, 645-703. doi:10.1613/jair.1.11396
    • NLM

      Silva FL da, Reali Costa AH. A Survey on Transfer Learning for Multiagent Reinforcement Learning Systems [Internet]. Journal of Artificial Intelligence Research. 2019 ; 64 645-703.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1613/jair.1.11396
    • Vancouver

      Silva FL da, Reali Costa AH. A Survey on Transfer Learning for Multiagent Reinforcement Learning Systems [Internet]. Journal of Artificial Intelligence Research. 2019 ; 64 645-703.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1613/jair.1.11396
  • 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: 10 jun. 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 jun. 10 ] 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 jun. 10 ] Available from: https://doi.org/10.1613/jair.5482
  • Source: Journal of Artificial Intelligence Research. Unidade: IME

    Assunto: LÓGICA

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

      DELGRANDE, James P. e WASSERMANN, Renata. Horn clause contraction functions. Journal of Artificial Intelligence Research, v. 48, n. 1, p. 475-511, 2013Tradução . . Disponível em: https://doi.org/10.1613/jair.4031. Acesso em: 10 jun. 2024.
    • APA

      Delgrande, J. P., & Wassermann, R. (2013). Horn clause contraction functions. Journal of Artificial Intelligence Research, 48( 1), 475-511. doi:10.1613/jair.4031
    • NLM

      Delgrande JP, Wassermann R. Horn clause contraction functions [Internet]. Journal of Artificial Intelligence Research. 2013 ; 48( 1): 475-511.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1613/jair.4031
    • Vancouver

      Delgrande JP, Wassermann R. Horn clause contraction functions [Internet]. Journal of Artificial Intelligence Research. 2013 ; 48( 1): 475-511.[citado 2024 jun. 10 ] Available from: https://doi.org/10.1613/jair.4031
  • Source: Journal of Artificial Intelligence Research. Unidade: IME

    Assunto: COMPUTABILIDADE E COMPLEXIDADE

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

      BOOTH, Richard et al. On the link between partial meet, kernel, and infra contraction and its application to Horn logic. Journal of Artificial Intelligence Research, v. 42, n. 1, p. 31-53, 2011Tradução . . Disponível em: https://doi.org/10.5555/2208436.2208438. Acesso em: 10 jun. 2024.
    • APA

      Booth, R., Meyer, T., Varzinczak, I., & Wassermann, R. (2011). On the link between partial meet, kernel, and infra contraction and its application to Horn logic. Journal of Artificial Intelligence Research, 42( 1), 31-53. doi:10.5555/2208436.2208438
    • NLM

      Booth R, Meyer T, Varzinczak I, Wassermann R. On the link between partial meet, kernel, and infra contraction and its application to Horn logic [Internet]. Journal of Artificial Intelligence Research. 2011 ; 42( 1): 31-53.[citado 2024 jun. 10 ] Available from: https://doi.org/10.5555/2208436.2208438
    • Vancouver

      Booth R, Meyer T, Varzinczak I, Wassermann R. On the link between partial meet, kernel, and infra contraction and its application to Horn logic [Internet]. Journal of Artificial Intelligence Research. 2011 ; 42( 1): 31-53.[citado 2024 jun. 10 ] Available from: https://doi.org/10.5555/2208436.2208438

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