Towards polynomial approximations of full propositional logic (2004)
- Autor:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- Assunto: CÁLCULO PROPOSICIONAL
- Idioma: Inglês
- Imprenta:
-
ABNT
FINGER, Marcelo. Towards polynomial approximations of full propositional logic. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/e80e8f98-3d5e-4ac6-ba53-8b64d2ec942e/1384819.pdf. Acesso em: 19 set. 2024. , 2004 -
APA
Finger, M. (2004). Towards polynomial approximations of full propositional logic. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/e80e8f98-3d5e-4ac6-ba53-8b64d2ec942e/1384819.pdf -
NLM
Finger M. Towards polynomial approximations of full propositional logic [Internet]. 2004 ;[citado 2024 set. 19 ] Available from: https://repositorio.usp.br/directbitstream/e80e8f98-3d5e-4ac6-ba53-8b64d2ec942e/1384819.pdf -
Vancouver
Finger M. Towards polynomial approximations of full propositional logic [Internet]. 2004 ;[citado 2024 set. 19 ] Available from: https://repositorio.usp.br/directbitstream/e80e8f98-3d5e-4ac6-ba53-8b64d2ec942e/1384819.pdf - 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
- Inteligência artificial e os rumos do processamento do português brasileiro
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 1384819.pdf | Direct link |
Como citar
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
