| Full text | |
| Author(s): |
Preto, Sandro
;
Finger, Marcelo
Total Authors: 2
|
| Document type: | Journal article |
| Source: | MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE; v. N/A, p. 26-pg., 2022-05-17. |
| Abstract | |
This work concerns the representation of a class of continuous functions into Logic, so that one may automatically reason about properties of these functions using logical tools. Rational McNaughton functions may be implicitly represented by logical formulas in Lukasiewicz Infinitely-valued Logic by constraining the set of allowed valuations; such a restriction contemplates only those valuations that satisfy specific formulas. This work investigates two approaches to such depiction, called representation modulo satisfiability. Furthermore, a polynomial-time algorithm that builds this representation is presented, producing a pair of formulas consisting of the representative formula and the constraining one, given as input a rational McNaughton function in a suitable encoding. An implementation of the algorithm is discussed. (AU) | |
| 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 |
| 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: | 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: | 15/21880-4 - PROVERBS -- PRobabilistic OVERconstrained Boolean Systems: reasoning tools and applications |
| Grantee: | Marcelo Finger |
| Support Opportunities: | Regular Research Grants |