Logical approximation and formal verification of neural networks (2024)
- Authors:
- USP affiliated authors: FINGER, MARCELO - IME ; PEVIDOR, JOAO FELIPE LOBO - IME ; PRETO, SANDRO MÁRCIO DA SILVA - IME
- Unidade: IME
- DOI: 10.5753/wbl.2024.2347
- Subjects: REDES NEURAIS; LÓGICA MATEMÁTICA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: SBC
- Publisher place: Porto Alegre
- Date published: 2024
- Source:
- Conference titles: Workshop Brasileiro de Lógica - WBL
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
PEVIDOR, João Felipe Lobo e PRETO, Sandro e FINGER, Marcelo. Logical approximation and formal verification of neural networks. 2024, Anais.. Porto Alegre: SBC, 2024. Disponível em: https://doi.org/10.5753/wbl.2024.2347. Acesso em: 01 ago. 2024. -
APA
Pevidor, J. F. L., Preto, S., & Finger, M. (2024). Logical approximation and formal verification of neural networks. In Anais. Porto Alegre: SBC. doi:10.5753/wbl.2024.2347 -
NLM
Pevidor JFL, Preto S, Finger M. Logical approximation and formal verification of neural networks [Internet]. Anais. 2024 ;[citado 2024 ago. 01 ] Available from: https://doi.org/10.5753/wbl.2024.2347 -
Vancouver
Pevidor JFL, Preto S, Finger M. Logical approximation and formal verification of neural networks [Internet]. Anais. 2024 ;[citado 2024 ago. 01 ] Available from: https://doi.org/10.5753/wbl.2024.2347 - Proving properties of binary classification neural networks via Łukasiewicz logic
- Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic
- Linking Łukasiewicz logic and boolean maximum satisfiability
- Effective reasoning over neural networks using Lukasiewicz logic
- Representing rational McNaughton functions via MODSAT relativisation
- Coherence of probabilistic constraints on Nash equilibria
- An efficient algorithm for representing piecewise linear functions into logic
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability
Informações sobre o DOI: 10.5753/wbl.2024.2347 (Fonte: oaDOI API)
Download do texto completo
Tipo | Nome | Link | |
---|---|---|---|
3206473.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas