6 citations · 7 across the 3 of their papers we have counts for
4 papers
Projected Model Counting
Rehan Abdul Aziz, Geoffrey Chu, Christian Muise +1
Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory F. Model counting is an essential tool in probabilistic r…
Stable Model Counting and Its Application in Probabilistic Logic Programming
Rehan Abdul Aziz, Geoffrey Chu, Christian Muise +1
Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic…
Bound Founded Answer Set Programming
Rehan Abdul Aziz
Answer Set Programming (ASP) is a powerful modelling formalism that is very efficient in solving combinatorial problems. ASP solvers implement the stable model semantics that elimi…
Grounding Bound Founded Answer Set Programs
Rehan Abdul Aziz, Geoffrey Chu, Peter James Stuckey
To appear in Theory and Practice of Logic Programming (TPLP) Bound Founded Answer Set Programming (BFASP) is an extension of Answer Set Programming (ASP) that extends stable model…