Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (2015)
- Authors:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- DOI: 10.1007/s10472-015-9466-6
- Subjects: INTELIGÊNCIA ARTIFICIAL; RACIOCÍNIO PROBABILÍSTICO; REPRESENTAÇÃO DE CONHECIMENTO
- Keywords: Probabilistic satisfiability; PSAT; Phase transition
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Annals of Mathematics and Artificial Intelligence
- ISSN: 1573-7470
- Volume/Número/Paginação/Ano: v. 75, n. 3-4, p. 351-389, 2015
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
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: 19 abr. 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 abr. 19 ] 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 abr. 19 ] Available from: https://doi.org/10.1007/s10472-015-9466-6 - Técnicas de otimização da precisão empregadas no etiquetador Tycho Brahe
- Concurrency control for perceivedly instantaneous transactions in valid-time databases
- Resource use pattern analysis for predicting resource availability in opportunistic grids
- Completeness for cut-based abduction
- On the predictability of classical propositional logic
- Automated classification of pathology reports
- Minimal axiomatizations and algebraic rings: a conjectured relationship
- Towards an efficient prover for the C1 paraconsistent logic
- Computational solutions for structural constraints: learning structural permissions in categorial grammar
- Towards polynomial approximations of full propositional logic
Informações sobre o DOI: 10.1007/s10472-015-9466-6 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
