| Full text | |
| Author(s): |
Finger, Marcelo
;
Preto, Sandro
Total Authors: 2
|
| Document type: | Journal article |
| Source: | JOURNAL OF LOGIC AND COMPUTATION; v. N/A, p. 15-pg., 2023-10-13. |
| Abstract | |
In this work, we present polyhedral semantics as a means to tractably approximate Lukasiewicz infinitely-valued logic (L$_{\infty}$). As L$_{\infty}$ is an expressive multivalued propositional logic whose decision problem is NP-complete, we show how to to obtain an approximation for this problem providing a family of multivalued logics over the same language as L$_{\infty}$. Each element of the family is associated to a polynomial-time linear program, thus providing a tractable way of deciding each intermediate step. We also investigate properties of the logic system derived from polyhedral semantics and the details of an algorithm for the approximation process. (AU) | |
| FAPESP's process: | 19/07665-4 - Center for Artificial Intelligence |
| Grantee: | Fabio Gagliardi Cozman |
| Support Opportunities: | Research Grants - Research Program in eScience and Data Science - Research Centers in Engineering Program |
| FAPESP's process: | 14/12236-1 - AnImaLS: Annotation of Images in Large Scale: what can machines and specialists learn from interaction? |
| Grantee: | Alexandre Xavier Falcão |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 15/21880-4 - PROVERBS -- PRobabilistic OVERconstrained Boolean Systems: reasoning tools and applications |
| Grantee: | Marcelo Finger |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 21/03117-2 - Formal verification of neural networks via Lukasiewicz infinitely-valued logic |
| Grantee: | Sandro Márcio da Silva Preto |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |