ReP USP - Resultado da busca

Filtros : "COMPUTABILIDADE E COMPLEXIDADE" "Wassermann, Renata" Removido: "Proceedings" Limpar

Filtros

Trabalho de evento-anais periodico
On the uncomputability of partial meet contraction for linear-time temporal logic (2018)
Guerra, Paulo T; Wassermann, Renata
Fonte: South American Journal of Logic. Nome do evento: Brazilian Logic Conference - EBL. Unidade: IME
Assuntos: LÓGICA, COMPUTABILIDADE E COMPLEXIDADE, REVISÃO DE CRENÇAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GUERRA, Paulo T e WASSERMANN, Renata. On the uncomputability of partial meet contraction for linear-time temporal logic. South American Journal of Logic. Campinas: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf. Acesso em: 27 nov. 2025. , 2018
APA
Guerra, P. T., & Wassermann, R. (2018). On the uncomputability of partial meet contraction for linear-time temporal logic. South American Journal of Logic. Campinas: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf
NLM
Guerra PT, Wassermann R. On the uncomputability of partial meet contraction for linear-time temporal logic [Internet]. South American Journal of Logic. 2018 ; 4( 2): 385-406.[citado 2025 nov. 27 ] Available from: http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf
Vancouver
Guerra PT, Wassermann R. On the uncomputability of partial meet contraction for linear-time temporal logic [Internet]. South American Journal of Logic. 2018 ; 4( 2): 385-406.[citado 2025 nov. 27 ] Available from: http://www.sa-logic.org/sajl-v4-i2/07-Guerra-Wassermann-SAJL.pdf
Artigo de periodico
On the link between partial meet, kernel, and infra contraction and its application to Horn logic (2011)
Booth, Richard ; Meyer, Thomas; Varzinczak, Ivan; Wassermann, Renata
Fonte: Journal of Artificial Intelligence Research. Unidade: IME
Assunto: COMPUTABILIDADE E COMPLEXIDADE
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: 27 nov. 2025.
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 2025 nov. 27 ] 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 2025 nov. 27 ] Available from: https://doi.org/10.5555/2208436.2208438

Biblioteca Digital de Produção Intelectual da Universidade de São Paulo 2012 - 2025