An efficient algorithm for representing piecewise linear functions into logic (2020)
- Authors:
- USP affiliated authors: FINGER, MARCELO - IME ; PRETO, SANDRO MÁRCIO DA SILVA - IME
- Unidade: IME
- DOI: 10.1016/j.entcs.2020.08.009
- Subjects: LÓGICA FORMAL; SEMÂNTICA
- Keywords: Łukasiewicz Infinitely-valued logic; rational McNaughton functions; piecewise linear functions
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Theoretical Computer Science
- ISSN: 1571-0661
- Volume/Número/Paginação/Ano: v. 351, p.167-186, 2020
- Conference titles: International Workshop on Logical and Semantic Frameworks, with Applications - LSFA 2020
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
PRETO, Sandro e FINGER, Marcelo. An efficient algorithm for representing piecewise linear functions into logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.entcs.2020.08.009. Acesso em: 20 jan. 2026. , 2020 -
APA
Preto, S., & Finger, M. (2020). An efficient algorithm for representing piecewise linear functions into logic. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2020.08.009 -
NLM
Preto S, Finger M. An efficient algorithm for representing piecewise linear functions into logic [Internet]. Electronic Notes in Theoretical Computer Science. 2020 ; 351 167-186.[citado 2026 jan. 20 ] Available from: https://doi.org/10.1016/j.entcs.2020.08.009 -
Vancouver
Preto S, Finger M. An efficient algorithm for representing piecewise linear functions into logic [Internet]. Electronic Notes in Theoretical Computer Science. 2020 ; 351 167-186.[citado 2026 jan. 20 ] Available from: https://doi.org/10.1016/j.entcs.2020.08.009 - Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
- Linking Łukasiewicz logic and boolean maximum satisfiability
- Proving properties of binary classification neural networks via Łukasiewicz logic
- Benchmarking Łukasiewicz logic solvers with properties of neural networks
- Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability
- Representing rational McNaughton functions via MODSAT relativisation
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- Effective reasoning over neural networks using Lukasiewicz logic
- Coherence of probabilistic constraints on Nash equilibria
- Regional, lattice and logical representations of neural networks
Informações sobre o DOI: 10.1016/j.entcs.2020.08.009 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3013847.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
