ReP USP - Resultado da busca

Artigo de periodico
Two AGM-style characterizations of model repair (2019)
Oliveira, Paulo de Tarso Guerra ; Wassermann, Renata
Source: Annals of Mathematics and Artificial Intelligence. Unidade: IME
Subjects: TEORIA DA REPRESENTAÇÃO, LÓGICA, REVISÃO DE CRENÇAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
OLIVEIRA, Paulo de Tarso Guerra e WASSERMANN, Renata. Two AGM-style characterizations of model repair. Annals of Mathematics and Artificial Intelligence, n. 87, p. 233–257, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10472-019-09656-4. Acesso em: 23 maio 2024.
APA
Oliveira, P. de T. G., & Wassermann, R. (2019). Two AGM-style characterizations of model repair. Annals of Mathematics and Artificial Intelligence, ( 87), 233–257. doi:10.1007/s10472-019-09656-4
NLM
Oliveira P de TG, Wassermann R. Two AGM-style characterizations of model repair [Internet]. Annals of Mathematics and Artificial Intelligence. 2019 ;( 87): 233–257.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-019-09656-4
Vancouver
Oliveira P de TG, Wassermann R. Two AGM-style characterizations of model repair [Internet]. Annals of Mathematics and Artificial Intelligence. 2019 ;( 87): 233–257.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-019-09656-4
Artigo de periodico
Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (2015)
Finger, Marcelo ; De Bona, Glauber
Source: Annals of Mathematics and Artificial Intelligence. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, RACIOCÍNIO PROBABILÍSTICO, REPRESENTAÇÃO DE CONHECIMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e DE BONA, Glauber. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. Annals of Mathematics and Artificial Intelligence, v. 75, n. 3-4, p. 351-389, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10472-015-9466-6. Acesso em: 23 maio 2024.
APA
Finger, M., & De Bona, G. (2015). Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. Annals of Mathematics and Artificial Intelligence, 75( 3-4), 351-389. doi:10.1007/s10472-015-9466-6
NLM
Finger M, De Bona G. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition [Internet]. Annals of Mathematics and Artificial Intelligence. 2015 ; 75( 3-4): 351-389.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-015-9466-6
Vancouver
Finger M, De Bona G. Probabilistic satisfiability: algorithms with the presence and absence of a phase transition [Internet]. Annals of Mathematics and Artificial Intelligence. 2015 ; 75( 3-4): 351-389.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-015-9466-6
Artigo de periodico
The USP Farmers herding team (2011)
Sichman, Jaime S. ; Gouveia, Gustavo Pacianotto; Pareira, Ricardo Hahn
Source: Annals of Mathematics and Artificial Intelligence. Unidade: EP
Assunto: ENGENHARIA ELÉTRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SICHMAN, Jaime S. e GOUVEIA, Gustavo Pacianotto e PAREIRA, Ricardo Hahn. The USP Farmers herding team. Annals of Mathematics and Artificial Intelligence, n. 4, p. 369-383, 2011Tradução . . Disponível em: https://doi.org/10.1007/s10472-011-9238-x. Acesso em: 23 maio 2024.
APA
Sichman, J. S., Gouveia, G. P., & Pareira, R. H. (2011). The USP Farmers herding team. Annals of Mathematics and Artificial Intelligence, ( 4), 369-383. doi:10.1007/s10472-011-9238-x
NLM
Sichman JS, Gouveia GP, Pareira RH. The USP Farmers herding team [Internet]. Annals of Mathematics and Artificial Intelligence. 2011 ;( 4): 369-383.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-011-9238-x
Vancouver
Sichman JS, Gouveia GP, Pareira RH. The USP Farmers herding team [Internet]. Annals of Mathematics and Artificial Intelligence. 2011 ;( 4): 369-383.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-011-9238-x
Artigo de periodico
Graphoid properties of epistemic irrelevance and independence (2005)
Cozman, Fabio Gagliardi ; Walley, Peter
Source: Annals of Mathematics and Artificial Intelligence. Unidade: EP
Subjects: PROBABILIDADE, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COZMAN, Fabio Gagliardi e WALLEY, Peter. Graphoid properties of epistemic irrelevance and independence. Annals of Mathematics and Artificial Intelligence, n. 1-2, p. 173-195, 2005Tradução . . Disponível em: https://doi.org/10.1007/s10472-005-9004-z. Acesso em: 23 maio 2024.
APA
Cozman, F. G., & Walley, P. (2005). Graphoid properties of epistemic irrelevance and independence. Annals of Mathematics and Artificial Intelligence, ( 1-2), 173-195. doi:10.1007/s10472-005-9004-z
NLM
Cozman FG, Walley P. Graphoid properties of epistemic irrelevance and independence [Internet]. Annals of Mathematics and Artificial Intelligence. 2005 ;( 1-2): 173-195.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-005-9004-z
Vancouver
Cozman FG, Walley P. Graphoid properties of epistemic irrelevance and independence [Internet]. Annals of Mathematics and Artificial Intelligence. 2005 ;( 1-2): 173-195.[citado 2024 maio 23 ] Available from: https://doi.org/10.1007/s10472-005-9004-z

USP Schools

ReP

Filtros

Authors

Subjects