Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic (2025)
- Authors:
- USP affiliated authors: FINGER, MARCELO - IME ; PRETO, SANDRO MÁRCIO DA SILVA - IME
- Unidade: IME
- DOI: 10.1093/logcom/exad059
- Subjects: LÓGICA MATEMÁTICA; PROGRAMAÇÃO LINEAR
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Logic and Computation
- ISSN: 0955-792X
- Volume/Número/Paginação/Ano: v. 35, n. 5, art. exad059, p. 1-15, 2025
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
FINGER, Marcelo e PRETO, Sandro. Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic. Journal of Logic and Computation, v. 35, n. 5, p. 1-15, 2025Tradução . . Disponível em: https://doi.org/10.1093/logcom/exad059. Acesso em: 10 fev. 2026. -
APA
Finger, M., & Preto, S. (2025). Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic. Journal of Logic and Computation, 35( 5), 1-15. doi:10.1093/logcom/exad059 -
NLM
Finger M, Preto S. Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic [Internet]. Journal of Logic and Computation. 2025 ; 35( 5): 1-15.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1093/logcom/exad059 -
Vancouver
Finger M, Preto S. Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic [Internet]. Journal of Logic and Computation. 2025 ; 35( 5): 1-15.[citado 2026 fev. 10 ] Available from: https://doi.org/10.1093/logcom/exad059 - Effective reasoning over neural networks using Lukasiewicz logic
- Probably half true: probabilistic satisfiability over Łukasiewicz infinitely-valued logic
- Regional, lattice and logical representations of neural networks
- An efficient algorithm for representing piecewise linear functions into logic
- Coherence of probabilistic constraints on Nash equilibria
- Benchmarking Łukasiewicz logic solvers with properties of neural networks
- Linking Łukasiewicz logic and boolean maximum satisfiability
- Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability
- Proving properties of binary classification neural networks via Łukasiewicz logic
- Representing rational McNaughton functions via MODSAT relativisation
Informações sobre o DOI: 10.1093/logcom/exad059 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3167046.pdf | ||
 |
3167046.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
