Probabilistic logic programming under the L-Stable semantics (2024)
- Authors:
- USP affiliated authors: MAUÁ, DENIS DERATANI - IME ; COZMAN, FABIO GAGLIARDI - EP
- Unidades: IME; EP
- Subjects: PROGRAMAÇÃO LÓGICA; SEMÂNTICA DE PROGRAMAÇÃO; PROBABILIDADE
- Keywords: Lógica probabilística; Probabilistic logic programming; Inconsistent knowledge bases; Computational complexity; Stable model semantics
- Language: Inglês
- Imprenta:
- Source:
- Título: CEUR Workshop Proceedings
- ISSN: 1613-0073
- Volume/Número/Paginação/Ano: v. 3835, p. 16-26, 2024
- Conference titles: International Workshop on Nonmonotonic Reasoning - NMR
-
ABNT
MAUÁ, Denis Deratani e COZMAN, Fabio Gagliardi e GARCES, Alexandro. Probabilistic logic programming under the L-Stable semantics. CEUR Workshop Proceedings. Aachen: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://ceur-ws.org/Vol-3835/paper3.pdf. Acesso em: 02 jan. 2026. , 2024 -
APA
Mauá, D. D., Cozman, F. G., & Garces, A. (2024). Probabilistic logic programming under the L-Stable semantics. CEUR Workshop Proceedings. Aachen: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://ceur-ws.org/Vol-3835/paper3.pdf -
NLM
Mauá DD, Cozman FG, Garces A. Probabilistic logic programming under the L-Stable semantics [Internet]. CEUR Workshop Proceedings. 2024 ; 3835 16-26.[citado 2026 jan. 02 ] Available from: https://ceur-ws.org/Vol-3835/paper3.pdf -
Vancouver
Mauá DD, Cozman FG, Garces A. Probabilistic logic programming under the L-Stable semantics [Internet]. CEUR Workshop Proceedings. 2024 ; 3835 16-26.[citado 2026 jan. 02 ] Available from: https://ceur-ws.org/Vol-3835/paper3.pdf - Fast local search methods for solving limited memory influence diagrams
- The complexity of inferences and explanations in probabilistic logic programming
- The finite model theory of bayesian networks: descriptive complexity
- A tractable class of model counting problems
- DL-Lite Bayesian networks: a tractable probabilistic graphical model
- On the semantics and complexity of probabilistic logic programs
- Credal sum-product networks
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- On the complexity of propositional and relational credal networks
- Specifying credal sets with probabilistic answer set programming
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3226764.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
