| Texto completo | |
| Autor(es): |
Finger, Marcelo
;
Preto, Sandro
Número total de Autores: 2
|
| Tipo de documento: | Artigo Científico |
| Fonte: | JOURNAL OF AUTOMATED REASONING; v. 64, n. 7, p. 18-pg., 2020-06-06. |
| Resumo | |
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) | |
| Processo FAPESP: | 14/12236-1 - AnImaLS: Anotação de Imagem em Larga Escala: o que máquinas e especialistas podem aprender interagindo? |
| Beneficiário: | Alexandre Xavier Falcão |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |
| Processo FAPESP: | 15/21880-4 - PROVERBS -- Sistemas Booleanos Probabilísticos Super-restritos: ferramentas de raciocínio e aplicações |
| Beneficiário: | Marcelo Finger |
| Modalidade de apoio: | Auxílio à Pesquisa - Regular |