On the relationship between And-Sum Circuits and deterministic boolean circuits (2025)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; GONÇALVES, JONAS RODRIGUES LIMA - IME
- Unidade: IME
- Subjects: INTELIGÊNCIA ARTIFICIAL; CIRCUITOS LÓGICOS; LÓGICA MATEMÁTICA
- Keywords: Circuitos booleanos; Representação do conhecimento; Inferência lógica; Compilação de conhecimento; Álgebra booleana
- Language: Inglês
- Imprenta:
- Publisher: AUAI Press
- Publisher place: Corvallis
- Date published: 2025
- Source:
- Título: Proceedings
- Volume/Número/Paginação/Ano: p. 1-5, 2025
- Conference titles: Conference on Uncertainty in Artificial Intelligence - UAI
-
ABNT
GONÇALVES, Jonas Rodrigues Lima e MAUÁ, Denis Deratani. On the relationship between And-Sum Circuits and deterministic boolean circuits. 2025, Anais.. Corvallis: AUAI Press, 2025. p. 1-5. Disponível em: https://openreview.net/pdf?id=VbFZDZpOi6. Acesso em: 10 fev. 2026. -
APA
Gonçalves, J. R. L., & Mauá, D. D. (2025). On the relationship between And-Sum Circuits and deterministic boolean circuits. In Proceedings (p. 1-5). Corvallis: AUAI Press. Recuperado de https://openreview.net/pdf?id=VbFZDZpOi6 -
NLM
Gonçalves JRL, Mauá DD. On the relationship between And-Sum Circuits and deterministic boolean circuits [Internet]. Proceedings. 2025 ; 1-5.[citado 2026 fev. 10 ] Available from: https://openreview.net/pdf?id=VbFZDZpOi6 -
Vancouver
Gonçalves JRL, Mauá DD. On the relationship between And-Sum Circuits and deterministic boolean circuits [Internet]. Proceedings. 2025 ; 1-5.[citado 2026 fev. 10 ] Available from: https://openreview.net/pdf?id=VbFZDZpOi6 - Compilação de conhecimento não-incremental de programas de conjuntos de respostas probabilísticos
- dPASP: a probabilistic logic programming environment for neurosymbolic learning and reasoning
- International Journal of Approximate Reasoning
- Early classification of time series by Hidden Markov Models with set-valued parameters
- Modelos de tópicos na classificação automática de resenhas de usuário
- Hidden Markov models with set-valued parameters
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
- Time robust trees: using temporal invariance to improve generalization
- Better initialization heuristics for order-based bayesian network structure learning
- Initialization heuristics for greedy bayesian network structure learning
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3256448_va.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
