Structurally-free theorem proving and the learning of structural permissions in categorial grammar (1998)
- Autor:
- Autor USP: FINGER, MARCELO - IME
- Unidade: IME
- Assunto: LÓGICA
- Language: Inglês
- Imprenta:
- Publisher: Université Pierre Mendes-France
- Publisher place: Grenoble
- Date published: 1998
- Conference titles: LACL 98: Logical Aspects of Computational Linguistics
-
ABNT
FINGER, Marcelo. Structurally-free theorem proving and the learning of structural permissions in categorial grammar. 1998, Anais.. Grenoble: Université Pierre Mendes-France, 1998. . Acesso em: 28 dez. 2025. -
APA
Finger, M. (1998). Structurally-free theorem proving and the learning of structural permissions in categorial grammar. In . Grenoble: Université Pierre Mendes-France. -
NLM
Finger M. Structurally-free theorem proving and the learning of structural permissions in categorial grammar. 1998 ;[citado 2025 dez. 28 ] -
Vancouver
Finger M. Structurally-free theorem proving and the learning of structural permissions in categorial grammar. 1998 ;[citado 2025 dez. 28 ] - 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”
- Sharing resource-sensitive knowledge using combinator logics
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
