ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Regional, lattice and logical representations of neural networks (2025)
Preto, Sandro ; Finger, Marcelo
Source: Electronic Proceedings in Theoretical Computer Science. Conference titles: International Workshop on Logical and Semantic Frameworks, with Applications - LSFA. Unidade: IME
Subjects: REDES NEURAIS, LÓGICA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRETO, Sandro e FINGER, Marcelo. Regional, lattice and logical representations of neural networks. Electronic Proceedings in Theoretical Computer Science. Sydney: Open Publishing Association. Disponível em: https://cgi.cse.unsw.edu.au/~eptcs/Published/LSFA2024/Proceedings.pdf. Acesso em: 27 nov. 2025. , 2025
APA
Preto, S., & Finger, M. (2025). Regional, lattice and logical representations of neural networks. Electronic Proceedings in Theoretical Computer Science. Sydney: Open Publishing Association. doi:10.4204/EPTCS.421.4
NLM
Preto S, Finger M. Regional, lattice and logical representations of neural networks [Internet]. Electronic Proceedings in Theoretical Computer Science. 2025 ; 421 64-79.[citado 2025 nov. 27 ] Available from: https://cgi.cse.unsw.edu.au/~eptcs/Published/LSFA2024/Proceedings.pdf
Vancouver
Preto S, Finger M. Regional, lattice and logical representations of neural networks [Internet]. Electronic Proceedings in Theoretical Computer Science. 2025 ; 421 64-79.[citado 2025 nov. 27 ] Available from: https://cgi.cse.unsw.edu.au/~eptcs/Published/LSFA2024/Proceedings.pdf
Trabalho de evento
Linking Łukasiewicz logic and boolean maximum satisfiability (2023)
Preto, Sandro ; Manyà, Felip ; Finger, Marcelo
Source: Proceedings. Conference titles: International Symposium on Multiple-Valued Logic - ISMVL. Unidade: IME
Subjects: COMPUTABILIDADE E COMPLEXIDADE, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRETO, Sandro e MANYÀ, Felip e FINGER, Marcelo. Linking Łukasiewicz logic and boolean maximum satisfiability. 2023, Anais.. Piscataway: IEEE, 2023. Disponível em: https://doi.org/10.1109/ISMVL57333.2023.00040. Acesso em: 27 nov. 2025.
APA
Preto, S., Manyà, F., & Finger, M. (2023). Linking Łukasiewicz logic and boolean maximum satisfiability. In Proceedings. Piscataway: IEEE. doi:10.1109/ISMVL57333.2023.00040
NLM
Preto S, Manyà F, Finger M. Linking Łukasiewicz logic and boolean maximum satisfiability [Internet]. Proceedings. 2023 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040
Vancouver
Preto S, Manyà F, Finger M. Linking Łukasiewicz logic and boolean maximum satisfiability [Internet]. Proceedings. 2023 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040
Trabalho de evento
Benchmarking Łukasiewicz logic solvers with properties of neural networks (2023)
Preto, Sandro ; Manyà, Felip ; Finger, Marcelo
Source: Proceedings. Conference titles: International Symposium on Multiple-Valued Logic - ISMVL. Unidade: IME
Subjects: REDES NEURAIS, PROGRAMAÇÃO LINEAR, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PRETO, Sandro e MANYÀ, Felip e FINGER, Marcelo. Benchmarking Łukasiewicz logic solvers with properties of neural networks. 2023, Anais.. Piscataway: IEEE, 2023. Disponível em: https://doi.org/10.1109/ISMVL57333.2023.00039. Acesso em: 27 nov. 2025.
APA
Preto, S., Manyà, F., & Finger, M. (2023). Benchmarking Łukasiewicz logic solvers with properties of neural networks. In Proceedings. Piscataway: IEEE. doi:10.1109/ISMVL57333.2023.00039
NLM
Preto S, Manyà F, Finger M. Benchmarking Łukasiewicz logic solvers with properties of neural networks [Internet]. Proceedings. 2023 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00039
Vancouver
Preto S, Manyà F, Finger M. Benchmarking Łukasiewicz logic solvers with properties of neural networks [Internet]. Proceedings. 2023 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00039
Trabalho de evento-anais periodico
Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics (2020)
Finger, Marcelo ; Preto, Sandro
Source: Journal of Automated Reasoning. Conference titles: Joint Conference on Automated Reasoning - IJCAR. Unidade: IME
Subjects: RACIOCÍNIO PROBABILÍSTICO, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e PRETO, Sandro. Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics. Journal of Automated Reasoning. Dordreccht: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1007/s10817-020-09558-9. Acesso em: 27 nov. 2025. , 2020
APA
Finger, M., & Preto, S. (2020). Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics. Journal of Automated Reasoning. Dordreccht: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/s10817-020-09558-9
NLM
Finger M, Preto S. Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics [Internet]. Journal of Automated Reasoning. 2020 ; 64( 7): 1269-1286.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10817-020-09558-9
Vancouver
Finger M, Preto S. Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics [Internet]. Journal of Automated Reasoning. 2020 ; 64( 7): 1269-1286.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/s10817-020-09558-9
Parte de monografia/livro
Extending EL++ with linear constraints on the probability of axioms (2019)
Finger, Marcelo
Source: Description logic, theory combination, and all that : essays dedicated to Franz Baader on the occasion of his 60th birthday. Unidade: IME
Subjects: LÓGICA, RACIOCÍNIO PROBABILÍSTICO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Extending EL++ with linear constraints on the probability of axioms. Description logic, theory combination, and all that : essays dedicated to Franz Baader on the occasion of his 60th birthday. Tradução . Cham: Springer, 2019. . Disponível em: https://doi.org/10.1007/978-3-030-22102-7_13. Acesso em: 27 nov. 2025.
APA
Finger, M. (2019). Extending EL++ with linear constraints on the probability of axioms. In Description logic, theory combination, and all that : essays dedicated to Franz Baader on the occasion of his 60th birthday. Cham: Springer. doi:10.1007/978-3-030-22102-7_13
NLM
Finger M. Extending EL++ with linear constraints on the probability of axioms [Internet]. In: Description logic, theory combination, and all that : essays dedicated to Franz Baader on the occasion of his 60th birthday. Cham: Springer; 2019. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-030-22102-7_13
Vancouver
Finger M. Extending EL++ with linear constraints on the probability of axioms [Internet]. In: Description logic, theory combination, and all that : essays dedicated to Franz Baader on the occasion of his 60th birthday. Cham: Springer; 2019. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-030-22102-7_13
Trabalho de evento-resumo
Sparse models: a tractable fragment for SAT, MAXSAT and PSAT (2019)
Finger, Marcelo
Source: Book of Abstracts. Conference titles: Brazilian Logic Conference - Encontro Brasileiro de Lógica (EBL). Unidade: IME
Subjects: LÓGICA, PROBABILIDADE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Sparse models: a tractable fragment for SAT, MAXSAT and PSAT. 2019, Anais.. João Pessoa: EDUFCG, 2019. Disponível em: https://ebl2019.ci.ufpb.br/assets/Book_of_Abstracts_EBL_2019.pdf. Acesso em: 27 nov. 2025.
APA
Finger, M. (2019). Sparse models: a tractable fragment for SAT, MAXSAT and PSAT. In Book of Abstracts. João Pessoa: EDUFCG. Recuperado de https://ebl2019.ci.ufpb.br/assets/Book_of_Abstracts_EBL_2019.pdf
NLM
Finger M. Sparse models: a tractable fragment for SAT, MAXSAT and PSAT [Internet]. Book of Abstracts. 2019 ;[citado 2025 nov. 27 ] Available from: https://ebl2019.ci.ufpb.br/assets/Book_of_Abstracts_EBL_2019.pdf
Vancouver
Finger M. Sparse models: a tractable fragment for SAT, MAXSAT and PSAT [Internet]. Book of Abstracts. 2019 ;[citado 2025 nov. 27 ] Available from: https://ebl2019.ci.ufpb.br/assets/Book_of_Abstracts_EBL_2019.pdf
Parte de monografia/livro
Inconsistency measurement in probabilistic logic (2018)
De Bona, Glauber ; Finger, Marcelo ; Potyka, Nico; Thimm, Matthias
Source: Measuring inconsistency in information. Unidades: IME, EP
Subjects: LÓGICA, RACIOCÍNIO PROBABILÍSTICO, INTELIGÊNCIA ARTIFICIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DE BONA, Glauber et al. Inconsistency measurement in probabilistic logic. Measuring inconsistency in information. Tradução . London: College Publications, 2018. . Disponível em: http://www.mthimm.de/pub/2018/DeBona_2018.pdf. Acesso em: 27 nov. 2025.
APA
De Bona, G., Finger, M., Potyka, N., & Thimm, M. (2018). Inconsistency measurement in probabilistic logic. In Measuring inconsistency in information. London: College Publications. Recuperado de http://www.mthimm.de/pub/2018/DeBona_2018.pdf
NLM
De Bona G, Finger M, Potyka N, Thimm M. Inconsistency measurement in probabilistic logic [Internet]. In: Measuring inconsistency in information. London: College Publications; 2018. [citado 2025 nov. 27 ] Available from: http://www.mthimm.de/pub/2018/DeBona_2018.pdf
Vancouver
De Bona G, Finger M, Potyka N, Thimm M. Inconsistency measurement in probabilistic logic [Internet]. In: Measuring inconsistency in information. London: College Publications; 2018. [citado 2025 nov. 27 ] Available from: http://www.mthimm.de/pub/2018/DeBona_2018.pdf
Trabalho de evento
Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic (2018)
Finger, Marcelo ; Preto, Sandro
Source: Proceedings. Conference titles: International Joint Conference on Automated Reasoning - IJCAR. Unidade: IME
Subjects: RACIOCÍNIO PROBABILÍSTICO, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e PRETO, Sandro. Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-94205-6_14. Acesso em: 27 nov. 2025.
APA
Finger, M., & Preto, S. (2018). Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-94205-6_14
NLM
Finger M, Preto S. Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic [Internet]. Proceedings. 2018 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-319-94205-6_14
Vancouver
Finger M, Preto S. Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic [Internet]. Proceedings. 2018 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-319-94205-6_14
Parte de monografia/livro
Quantitative logic reasoning (2018)
Finger, Marcelo
Source: Contradictions, from consistency to inconsistency. Unidade: IME
Subjects: LÓGICA, RACIOCÍNIO DEDUTIVO E INDUTIVO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Quantitative logic reasoning. Contradictions, from consistency to inconsistency. Tradução . Cham: Springer, 2018. . Disponível em: https://doi.org/10.1007/978-3-319-98797-2_12. Acesso em: 27 nov. 2025.
APA
Finger, M. (2018). Quantitative logic reasoning. In Contradictions, from consistency to inconsistency. Cham: Springer. doi:10.1007/978-3-319-98797-2_12
NLM
Finger M. Quantitative logic reasoning [Internet]. In: Contradictions, from consistency to inconsistency. Cham: Springer; 2018. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-319-98797-2_12
Vancouver
Finger M. Quantitative logic reasoning [Internet]. In: Contradictions, from consistency to inconsistency. Cham: Springer; 2018. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-319-98797-2_12
Trabalho de evento
Classical and quantum satisfiability (2012)
Araújo, Anderson de; Finger, Marcelo
Source: Proceedings. Conference titles: Workshop on Logical and Semantic Frameworks with Applications - EPTCS. Unidade: IME
Subjects: RACIOCÍNIO PROBABILÍSTICO, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Anderson de e FINGER, Marcelo. Classical and quantum satisfiability. 2012, Anais.. Sydney: EPTCS, 2012. Disponível em: http://eptcs.web.cse.unsw.edu.au/paper.cgi?LSFA2011.6.pdf. Acesso em: 27 nov. 2025.
APA
Araújo, A. de, & Finger, M. (2012). Classical and quantum satisfiability. In Proceedings. Sydney: EPTCS. Recuperado de http://eptcs.web.cse.unsw.edu.au/paper.cgi?LSFA2011.6.pdf
NLM
Araújo A de, Finger M. Classical and quantum satisfiability [Internet]. Proceedings. 2012 ;[citado 2025 nov. 27 ] Available from: http://eptcs.web.cse.unsw.edu.au/paper.cgi?LSFA2011.6.pdf
Vancouver
Araújo A de, Finger M. Classical and quantum satisfiability [Internet]. Proceedings. 2012 ;[citado 2025 nov. 27 ] Available from: http://eptcs.web.cse.unsw.edu.au/paper.cgi?LSFA2011.6.pdf
Trabalho de evento
A refuted conjecture on probabilistic satisfiability (2010)
Finger, Marcelo ; De Bona, Glauber
Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidades: IME, EP
Subjects: RACIOCÍNIO PROBABILÍSTICO, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e DE BONA, Glauber. A refuted conjecture on probabilistic satisfiability. 2010, Anais.. Berlin: Springer, 2010. Disponível em: https://doi.org/10.1007/978-3-642-16138-4_30. Acesso em: 27 nov. 2025.
APA
Finger, M., & De Bona, G. (2010). A refuted conjecture on probabilistic satisfiability. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-16138-4_30
NLM
Finger M, De Bona G. A refuted conjecture on probabilistic satisfiability [Internet]. Proceedings. 2010 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_30
Vancouver
Finger M, De Bona G. A refuted conjecture on probabilistic satisfiability [Internet]. Proceedings. 2010 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-642-16138-4_30
Trabalho de evento
Polynomial approximations of full propositional logic via limited bivalence (2004)
Finger, Marcelo
Source: Proceedings. Conference titles: European Workshop on Logics in Artificial Intelligence - JELIA. Unidade: IME
Subjects: APROXIMAÇÃO POR POLINÔMIOS, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Polynomial approximations of full propositional logic via limited bivalence. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30227-8_44. Acesso em: 27 nov. 2025.
APA
Finger, M. (2004). Polynomial approximations of full propositional logic via limited bivalence. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30227-8_44
NLM
Finger M. Polynomial approximations of full propositional logic via limited bivalence [Internet]. Proceedings. 2004 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-540-30227-8_44
Vancouver
Finger M. Polynomial approximations of full propositional logic via limited bivalence [Internet]. Proceedings. 2004 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-540-30227-8_44
Trabalho de evento
Towards polynomial approximations of full propositional logic (2004)
Finger, Marcelo
Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME
Subjects: APROXIMAÇÃO POR POLINÔMIOS, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. Towards polynomial approximations of full propositional logic. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-28645-5_2. Acesso em: 27 nov. 2025.
APA
Finger, M. (2004). Towards polynomial approximations of full propositional logic. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-28645-5_2
NLM
Finger M. Towards polynomial approximations of full propositional logic [Internet]. Proceedings. 2004 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_2
Vancouver
Finger M. Towards polynomial approximations of full propositional logic [Internet]. Proceedings. 2004 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_2
Artigo de periodico
The unrestricted combination of temporal logic systems (2002)
Finger, Marcelo ; Weiss, Maria Angela
Source: Logic Journal of the IGPL. Unidade: IME
Assunto: LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e WEISS, Maria Angela. The unrestricted combination of temporal logic systems. Logic Journal of the IGPL, v. 10, n. 2, p. 165-189, 2002Tradução . . Disponível em: https://doi.org/10.1093/jigpal/10.2.165. Acesso em: 27 nov. 2025.
APA
Finger, M., & Weiss, M. A. (2002). The unrestricted combination of temporal logic systems. Logic Journal of the IGPL, 10( 2), 165-189. doi:10.1093/jigpal/10.2.165
NLM
Finger M, Weiss MA. The unrestricted combination of temporal logic systems [Internet]. Logic Journal of the IGPL. 2002 ; 10( 2): 165-189.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1093/jigpal/10.2.165
Vancouver
Finger M, Weiss MA. The unrestricted combination of temporal logic systems [Internet]. Logic Journal of the IGPL. 2002 ; 10( 2): 165-189.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1093/jigpal/10.2.165
Trabalho de evento
Tableaux for approximate reasoning (2001)
Finger, Marcelo ; Wassermann, Renata
Source: Proceedings. Conference titles: International Joint Conference on Artificial Intelligence - IJCAI. Unidade: IME
Assunto: LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e WASSERMANN, Renata. Tableaux for approximate reasoning. 2001, Anais.. Seatle: IJCAI, 2001. . Acesso em: 27 nov. 2025.
APA
Finger, M., & Wassermann, R. (2001). Tableaux for approximate reasoning. In Proceedings. Seatle: IJCAI.
NLM
Finger M, Wassermann R. Tableaux for approximate reasoning. Proceedings. 2001 ;[citado 2025 nov. 27 ]
Vancouver
Finger M, Wassermann R. Tableaux for approximate reasoning. Proceedings. 2001 ;[citado 2025 nov. 27 ]
Relatorio tecnico
Tableaux for approximate reasoning (2001)
Finger, Marcelo ; Wassermann, Renata
Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e WASSERMANN, Renata. Tableaux for approximate reasoning. . São Paulo: IME-USP. Disponível em: https://repositorio.usp.br/directbitstream/23102ae3-f25b-4320-aecd-c935f62eebe2/1195808.pdf. Acesso em: 27 nov. 2025. , 2001
APA
Finger, M., & Wassermann, R. (2001). Tableaux for approximate reasoning. São Paulo: IME-USP. Recuperado de https://repositorio.usp.br/directbitstream/23102ae3-f25b-4320-aecd-c935f62eebe2/1195808.pdf
NLM
Finger M, Wassermann R. Tableaux for approximate reasoning [Internet]. 2001 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/23102ae3-f25b-4320-aecd-c935f62eebe2/1195808.pdf
Vancouver
Finger M, Wassermann R. Tableaux for approximate reasoning [Internet]. 2001 ;[citado 2025 nov. 27 ] Available from: https://repositorio.usp.br/directbitstream/23102ae3-f25b-4320-aecd-c935f62eebe2/1195808.pdf
Parte de monografia/livro
Two-dimensional executable temporal logic for bitemporal databases (2000)
Finger, Marcelo ; Reynolds, Mark
Source: Advances in temporal logic. Unidade: IME
Assunto: LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e REYNOLDS, Mark. Two-dimensional executable temporal logic for bitemporal databases. Advances in temporal logic. Tradução . Dordrecht: Springer, 2000. . Disponível em: https://doi.org/10.1007/978-94-015-9586-5_20. Acesso em: 27 nov. 2025.
APA
Finger, M., & Reynolds, M. (2000). Two-dimensional executable temporal logic for bitemporal databases. In Advances in temporal logic. Dordrecht: Springer. doi:10.1007/978-94-015-9586-5_20
NLM
Finger M, Reynolds M. Two-dimensional executable temporal logic for bitemporal databases [Internet]. In: Advances in temporal logic. Dordrecht: Springer; 2000. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-94-015-9586-5_20
Vancouver
Finger M, Reynolds M. Two-dimensional executable temporal logic for bitemporal databases [Internet]. In: Advances in temporal logic. Dordrecht: Springer; 2000. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-94-015-9586-5_20
Artigo de periodico
A logical reconstruction of temporal databases (2000)
Finger, Marcelo
Source: Journal of Logic and Computation. Unidade: IME
Assunto: LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo. A logical reconstruction of temporal databases. Journal of Logic and Computation, v. 10, n. 6, p. 847-876, 2000Tradução . . Disponível em: https://doi.org/10.1093/logcom/10.6.847. Acesso em: 27 nov. 2025.
APA
Finger, M. (2000). A logical reconstruction of temporal databases. Journal of Logic and Computation, 10( 6), 847-876. doi:10.1093/logcom/10.6.847
NLM
Finger M. A logical reconstruction of temporal databases [Internet]. Journal of Logic and Computation. 2000 ; 10( 6): 847-876.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1093/logcom/10.6.847
Vancouver
Finger M. A logical reconstruction of temporal databases [Internet]. Journal of Logic and Computation. 2000 ; 10( 6): 847-876.[citado 2025 nov. 27 ] Available from: https://doi.org/10.1093/logcom/10.6.847
Parte de monografia/livro
Imperative history: two-dimensional executable temporal logic (1999)
Finger, Marcelo ; Reynolds, Mark C.
Source: Logic, language and reasoning : essays in honour of Dov Gabbay. Unidade: IME
Assunto: LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FINGER, Marcelo e REYNOLDS, Mark C. Imperative history: two-dimensional executable temporal logic. Logic, language and reasoning : essays in honour of Dov Gabbay. Tradução . Dordrecht: Springer, 1999. . Disponível em: https://doi.org/10.1007/978-94-011-4574-9_5. Acesso em: 27 nov. 2025.
APA
Finger, M., & Reynolds, M. C. (1999). Imperative history: two-dimensional executable temporal logic. In Logic, language and reasoning : essays in honour of Dov Gabbay. Dordrecht: Springer. doi:10.1007/978-94-011-4574-9_5
NLM
Finger M, Reynolds MC. Imperative history: two-dimensional executable temporal logic [Internet]. In: Logic, language and reasoning : essays in honour of Dov Gabbay. Dordrecht: Springer; 1999. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-94-011-4574-9_5
Vancouver
Finger M, Reynolds MC. Imperative history: two-dimensional executable temporal logic [Internet]. In: Logic, language and reasoning : essays in honour of Dov Gabbay. Dordrecht: Springer; 1999. [citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-94-011-4574-9_5
Trabalho de evento
Structurally-free theorem proving and the learning of structural permissions in categorial grammar (1998)
Finger, Marcelo
Conference titles: LACL 98: Logical Aspects of Computational Linguistics. Unidade: IME
Assunto: LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 27 nov. 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 nov. 27 ]
Vancouver
Finger M. Structurally-free theorem proving and the learning of structural permissions in categorial grammar. 1998 ;[citado 2025 nov. 27 ]

USP Schools

ReP

Filtros

Document Types

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies