Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial] (2015)
- Authors:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- DOI: 10.1016/j.tcs.2015.10.028
- Subjects: RACIOCÍNIO PROBABILÍSTICO; LINGUÍSTICA COMPUTACIONAL
- Language: Inglês
- Imprenta:
- Source:
- Título: Theoretical Computer Science
- ISSN: 1879-2294
- Volume/Número/Paginação/Ano: v. 606, p.1, nov. 2015)
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial]. Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.tcs.2015.10.028. Acesso em: 06 jun. 2025. , 2015 -
APA
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial]. (2015). Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial]. Theoretical Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.tcs.2015.10.028 -
NLM
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial] [Internet]. Theoretical Computer Science. 2015 ; no 2015) 1.[citado 2025 jun. 06 ] Available from: https://doi.org/10.1016/j.tcs.2015.10.028 -
Vancouver
Special issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). [Editorial] [Internet]. Theoretical Computer Science. 2015 ; no 2015) 1.[citado 2025 jun. 06 ] Available from: https://doi.org/10.1016/j.tcs.2015.10.028 - Structurally-free theorem proving and the learning of structural permissions in categorial grammar
- Towards structurally-free theorem proving
- Polynomial approximations of full propositional logic via limited bivalence
- Towards polynomial approximations of full propositional logic
- Imperative history: two-dimensional executable temporal logic
- Previsão da temática de notícias futuras: implementação do algoritmo PROPHET a dados de um jornal de grande circulação
- The 11th International Symposium on Frontiers of Combining Systems (FroCoS) was held 27–29th September 2017 at the University of Brasília... [Prefácio]
- Advances in weighted logics for artificial intelligence. [Editorial]
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
- Quando se compra inteligência artificial, o que de fato se leva para casa? Além do “oba-oba”
Informações sobre o DOI: 10.1016/j.tcs.2015.10.028 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
