Aspmc: new frontiers of algebraic answer set counting
From MaRDI portal
(Redirected from Publication:6566624)
Recommendations
Cites work
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- A partial k-arboretum of graphs with bounded treewidth
- Algebraic circuits for decision theoretic inference and learning
- Algebraic model counting
- Answer set programming based on propositional satisfiability
- ASSAT: computing answer sets of a logic program by SAT solvers
- Backdoors to tractable answer set programming
- Binary Decision Diagrams
- Compact translations of non-disjunctive answer set programs to propositional clauses
- Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
- Connecting knowledge compilation classes and width parameters
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Declarative Logic Programming: Theory, Systems, and Applications
- Dedicated tabling for a probabilistic setting
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- Graph bisection with Pareto optimization
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- scientific article; zbMATH DE number 3420754 (Why is no real title available?)
- Improving the normalization of weight rules in answer set programs
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5--8, 2017. Proceedings
- Logic programming and knowledge representation
- Logic programming and nonmonotonic reasoning. Proceedings of the 4th international conference, LPNMR '97, held in Dagstuhl, Germany, July 28--31, 1997
- MAP inference for probabilistic logic programming
- Neural probabilistic logic programming in DeepProbLog
- On elementary loops of logic programs
- On probabilistic inference by weighted model counting
- Parameterized and Exact Computation
- Positive-instance driven dynamic programming for treewidth
- Probabilistic (logic) programming concepts
- Probabilistic planning via heuristic forward search and weighted model counting
- Probabilistic reasoning with answer sets
- Semantics and complexity of recursive aggregates in answer set programming
- Semiring programming: a semantic framework for generalized sum product problems
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Stable models and difference logic
- The Semantics of Predicate Logic as a Programming Language
- Theory and applications of satisfiability testing -- SAT 2020. 23rd international conference, Alghero, Italy, July 3--10, 2020. Proceedings
- Tree-width, path-width, and cutwidth
- Treewidth in Verification: Local vs. Global
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Treewidth. Computations and approximations
- Treewidth: computational experiments
- Weighted automata and weighted logics
- Weighted Lars for quantitative stream reasoning
- Why are there so many loop formulas?
Cited in
(2)
This page was built for publication: Aspmc: new frontiers of algebraic answer set counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566624)
