Search Results for author: Peter James Stuckey

Found 3 papers, 0 papers with code

Grounding Bound Founded Answer Set Programs

no code implementations14 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.

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems

no code implementations4 Feb 2014 Amit Metodi, Michael Codish, Peter James Stuckey

We introduce a tool called BEE (Ben-Gurion Equi-propagation Encoder) based on these ideas and demonstrate for a variety of benchmarks that our approach leads to a considerable reduction in the size of CNF encodings and subsequent speed-ups in SAT solving times.

Fast Set Bounds Propagation Using a BDD-SAT Hybrid

no code implementations16 Jan 2014 Graeme Gange, Peter James Stuckey, Vitaly Lagoon

Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems.

Cannot find the paper you are looking for? You can Submit a new open access paper.