no code implementations • 28 Jul 2015 • Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey
The task is to compute the number of assignments to P such that there exists an extension to 'non-priority' variables V\P that satisfies F. Projected model counting arises when some parts of the model are irrelevant to the counts, in particular when we require additional variables to model the problem we are counting in SAT.
no code implementations • 20 Nov 2014 • Rehan Abdul Aziz, Geoffrey Chu, Christian Muise, Peter Stuckey
Model counting is the problem of computing the number of models that satisfy a given propositional theory.
no code implementations • 14 May 2014 • Rehan Abdul Aziz, Geoffrey Chu, Peter James Stuckey
Next, we extend the bottom-up grounding technique and magic set transformation used by ASP to BFASP programs.
no code implementations • 14 May 2014 • Rehan Abdul Aziz
This deficiency of stable model semantics introduces another type of grounding bottleneck in ASP systems that cannot be removed by naively merging ASP with CP solvers, but requires a theoretical extension of the semantics from Booleans and normal rules to bounds over numeric variables and more general rules.
