dPASP: a probabilistic logic programming environment for neurosymbolic learning and reasoning (2024)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP ; SILVEIRA, IGOR CATANEO - IME ; GONÇALVES, JONAS RODRIGUES LIMA - IME
- Unidades: IME; EP
- DOI: 10.24963/kr.2024/69
- Subjects: INTELIGÊNCIA ARTIFICIAL; PROGRAMAÇÃO LÓGICA; SEMÂNTICA; APRENDIZADO COMPUTACIONAL; COMPUTAÇÃO EVOLUTIVA; REDES NEURAIS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: IJCAI Organization
- Publisher place: California
- Date published: 2024
- Source:
- Título: Proceedings
- Conference titles: International Conference on Principles of Knowledge Representation and Reasoning – KR
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
GEH, Renato Lui et al. dPASP: a probabilistic logic programming environment for neurosymbolic learning and reasoning. 2024, Anais.. California: IJCAI Organization, 2024. Disponível em: https://doi.org/10.24963/kr.2024/69. Acesso em: 26 dez. 2025. -
APA
Geh, R. L., Gonçalves, J., Silveira, I. C., Mauá, D. D., & Cozman, F. G. (2024). dPASP: a probabilistic logic programming environment for neurosymbolic learning and reasoning. In Proceedings. California: IJCAI Organization. doi:10.24963/kr.2024/69 -
NLM
Geh RL, Gonçalves J, Silveira IC, Mauá DD, Cozman FG. dPASP: a probabilistic logic programming environment for neurosymbolic learning and reasoning [Internet]. Proceedings. 2024 ;[citado 2025 dez. 26 ] Available from: https://doi.org/10.24963/kr.2024/69 -
Vancouver
Geh RL, Gonçalves J, Silveira IC, Mauá DD, Cozman FG. dPASP: a probabilistic logic programming environment for neurosymbolic learning and reasoning [Internet]. Proceedings. 2024 ;[citado 2025 dez. 26 ] Available from: https://doi.org/10.24963/kr.2024/69 - On the relationship between And-Sum Circuits and deterministic boolean circuits
- Fast local search methods for solving limited memory influence diagrams
- The complexity of inferences and explanations in probabilistic logic programming
- A tractable class of model counting problems
- The finite model theory of bayesian networks: descriptive complexity
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
- On the complexity of propositional and relational credal networks
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Specifying credal sets with probabilistic answer set programming
- On the semantics and complexity of probabilistic logic programs
Informações sobre o DOI: 10.24963/kr.2024/69 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3226823.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
