Linking Łukasiewicz logic and boolean maximum satisfiability (2023)
- Authors:
- USP affiliated authors: FINGER, MARCELO - IME ; PRETO, SANDRO MÁRCIO DA SILVA - IME
- Unidade: IME
- DOI: 10.1109/ISMVL57333.2023.00040
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; LÓGICA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2023
- Source:
- Título: Proceedings
- Conference titles: International Symposium on Multiple-Valued Logic - ISMVL
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 09 fev. 2026. -
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 2026 fev. 09 ] 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 2026 fev. 09 ] Available from: https://doi.org/10.1109/ISMVL57333.2023.00040 - 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
- Probably partially true: satisfiability for Łukasiewicz infinitely-valued probabilistic logic and related topics
- 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
- Representing rational McNaughton functions via MODSAT relativisation
- Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic
- Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability
Informações sobre o DOI: 10.1109/ISMVL57333.2023.00040 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3150069.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
