Solving decision theory problems with probabilistic answer set programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- ASP-Core-2 input language format
- Algebraic model counting
- Answer set programming for computing decisions under uncertainty
- Answer sets and qualitative decision making
- Artificial Intelligence: Methodology, Systems, and Applications
- Binary Decision Diagrams
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- Graph bisection with Pareto optimization
- Graphs, dioids and semirings. New models and algorithms.
- Introduction to imprecise probabilities
- Logics in Artificial Intelligence
- Multi-shot ASP solving with clingo
- On the complexity of constructing optimal ordered binary decision diagrams
- Principles and practice of constraint programming. 20th international conference, CP 2014, Lyon, France, September 8--12, 2014. Proceedings
- Probabilistic reasoning with answer sets
- Solution Enumeration for Projected Boolean Search Problems
- Statistical statements in probabilistic logic programming
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- \textsc{sm}ProbLog: stable model semantics in ProbLog for probabilistic argumentation
This page was built for publication: Solving decision theory problems with probabilistic answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008043)
