Aspmc: new frontiers of algebraic answer set counting
From MaRDI portal
Publication:6566624
DOI10.1016/j.artint.2024.104109MaRDI QIDQ6566624
Rafael Kiesel, Thomas Eiter, Markus Hecher
Publication date: 3 July 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
treewidthprobabilistic inferencesemiringsanswer set programmingknowledge compilationalgebraic answer set countingcycle breaking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
- Semantics and complexity of recursive aggregates in answer set programming
- Connecting knowledge compilation classes and width parameters
- ASSAT: computing answer sets of a logic program by SAT solvers
- Answer set programming based on propositional satisfiability
- Probabilistic (logic) programming concepts
- Stable models and difference logic
- A partial k-arboretum of graphs with bounded treewidth
- Treewidth. Computations and approximations
- Tree-width, path-width, and cutwidth
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Logic programming and nonmonotonic reasoning. Proceedings of the 4th international conference, LPNMR '97, held in Dagstuhl, Germany, July 28--31, 1997
- Semiring programming: a semantic framework for generalized sum product problems
- Theory and applications of satisfiability testing -- SAT 2020. 23rd international conference, Alghero, Italy, July 3--10, 2020. Proceedings
- Neural probabilistic logic programming in DeepProbLog
- Backdoors to tractable answer set programming
- Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5--8, 2017. Proceedings
- Weighted automata and weighted logics
- On probabilistic inference by weighted model counting
- Algebraic model counting
- Positive-instance driven dynamic programming for treewidth
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Dedicated tabling for a probabilistic setting
- On elementary loops of logic programs
- Improving the Normalization of Weight Rules in Answer Set Programs
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Probabilistic reasoning with answer sets
- The Semantics of Predicate Logic as a Programming Language
- Binary Decision Diagrams
- Logic programming and knowledge representation
- Declarative Logic Programming: Theory, Systems, and Applications
- Graph Bisection with Pareto Optimization
- Computing LPMLN using ASP and MLN solvers
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Efficient Knowledge Compilation Beyond Weighted Model Counting
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- MAP Inference for Probabilistic Logic Programming
- Why are there so many loop formulas?
- Parameterized and Exact Computation
- Treewidth in Verification: Local vs. Global
This page was built for publication: Aspmc: new frontiers of algebraic answer set counting