The model counting competition 2020
Many computational problems in modern society account to probabilistic reasoning,
statistics, and combinatorics. A variety of these real-world questions can be solved by …
statistics, and combinatorics. A variety of these real-world questions can be solved by …
Selection of database management system by using multi-attribute decision-making approach based on probability complex fuzzy aggregation operators
U ur Rehman - Journal of Innovative Research in Mathematical …, 2023 - jirmcs.agasr.org
A database management system (DBMS) is a piece of software that makes it easier to
create, organize, store, retrieve, and manage structured data. It functions as a central system …
create, organize, store, retrieve, and manage structured data. It functions as a central system …
Treewidth-aware reductions of normal ASP to SAT–Is normal ASP harder than SAT after all?
M Hecher - Artificial Intelligence, 2022 - Elsevier
Abstract Answer Set Programming (ASP) is a paradigm for modeling and solving problems
for knowledge representation and reasoning. There are plenty of results dedicated to …
for knowledge representation and reasoning. There are plenty of results dedicated to …
Rushing and strolling among answer sets–navigation made easy
Answer set programming (ASP) is a popular declarative programming paradigm with a wide
range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with …
range of applications in artificial intelligence. Oftentimes, when modeling an AI problem with …
DPMC: weighted model counting by dynamic programming on project-join trees
We propose a unifying dynamic-programming framework to compute exact literal-weighted
model counts of formulas in conjunctive normal form. At the center of our framework are …
model counts of formulas in conjunctive normal form. At the center of our framework are …
[PDF][PDF] Plausibility Reasoning via Projected Answer Set Counting-A Hybrid Approach.
Answer set programming is a form of declarative programming widely used to solve difficult
search problems. Probabilistic applications however require to go beyond simple search for …
search problems. Probabilistic applications however require to go beyond simple search for …
Taming high treewidth with abstraction, nested dynamic programming, and database technology
Treewidth is one of the most prominent structural parameters. While numerous theoretical
results establish tractability under the assumption of fixed treewidth, the practical success of …
results establish tractability under the assumption of fixed treewidth, the practical success of …
Solving projected model counting by utilizing treewidth and its limits
In this paper, we introduce a novel algorithm to solve projected model counting (PMC). PMC
asks to count solutions of a Boolean formula with respect to a given set of projection …
asks to count solutions of a Boolean formula with respect to a given set of projection …
Procount: Weighted projected model counting with graded project-join trees
Recent work in weighted model counting proposed a unifying framework for dynamic-
programming algorithms. The core of this framework is a project-join tree: an execution plan …
programming algorithms. The core of this framework is a project-join tree: an execution plan …
Lower bounds for QBFs of bounded treewidth
The problem of deciding the validity (QSat) of quantified Boolean formulas (QBF) is a vivid
research area in both theory and practice. In the field of parameterized algorithmics, the well …
research area in both theory and practice. In the field of parameterized algorithmics, the well …