In this paper, we introduce a novel algorithm to solve projected model
c...
The QSAT problem, which asks to evaluate a quantified Boolean formula (Q...
Answer Set Programming (ASP) is a problem modeling and solving framework...
Answer Set Programming (ASP) is a paradigm for modeling and solving prob...
Computer programs, so-called solvers, for solving the well-known Boolean...
Extending the popular Answer Set Programming (ASP) paradigm by introspec...
Many computational problems in modern society account to probabilistic
r...
The Steiner tree problem is a well-known problem in network design, rout...
We compare the impact of hardware advancement and algorithm advancement ...
It is well-know that deciding consistency for normal answer set programs...
Epistemic logic programs (ELPs) are a popular generalization of standard...
Bounded treewidth is one of the most cited combinatorial invariants, whi...
The problem of deciding the validity (QSAT) of quantified Boolean formul...
Answer Set Programming (ASP) solvers are highly-tuned and complex proced...
Parameterized algorithms have been subject to extensive research of rece...
In this paper, we introduce novel algorithms to solve projected answer s...
In this paper, we consider counting and projected model counting of
exte...
In this paper, we introduce a novel algorithm to solve projected model
c...
In this paper, we study Reiter's propositional default logic when the
tr...
A vibrant theoretical research area are efficient exact parameterized
al...
Parameterized algorithms are a way to solve hard problems more efficient...
While the solution counting problem for propositional satisfiability (#S...