| Full text | |
| Author(s): |
Finger, Marcelo
;
Preto, Sandro
Total Authors: 2
|
| Document type: | Journal article |
| Source: | JOURNAL OF AUTOMATED REASONING; v. 64, n. 7, p. 18-pg., 2020-06-06. |
| Abstract | |
We study probabilistic-logic reasoning in a context that allows for "partial truths", focusing on computational and algorithmic properties of non-classical Lukasiewicz Infinitely-valued Probabilistic Logic. In particular, we study the satisfiability of joint probabilistic assignments, which we call LIPSAT. Although the search space is initially infinite, we provide linear algebraic methods that guarantee polynomial size witnesses, placing LIPSAT complexity in the NP-complete class. An exact satisfiability decision algorithm is presented which employs, as a subroutine, the decision problem for Lukasiewicz Infinitely-valued (non probabilistic) logic, that is also an NP-complete problem. We investigate efficient representation of rational McNaughton functions in Lukasiewicz Infinitely-valued Logic modulo satisfiability. (AU) | |
| 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 |