Number of items: 7.
Gomes, Carla P. and Hoffmann, Jörg and Sabharwal, Ashish and Selman, Bart
(2007)
From Sampling to Model Counting.
Hoffmann, Jörg and Gomes, Carla P. and Selman, Bart and Kautz, Henry A.
(2007)
SAT Encodings of State-Space Reachability Problems in Numeric Domains.
Gomes, Carla P. and Hoffmann, Jörg and Sabharwal, Ashish and Selman, Bart
(2007)
Sampling and Soundness: Can We Have Both?
Gomes, Carla P. and Hoffmann, Jörg and Sabharwal, Ashish and Selman, Bart
(2007)
Short XORs for Model Counting: From Theory to Practice.
Hoffmann, Jörg and Gomes, Carla P. and Selman, Bart
(2007)
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Logical Methods in Computer Science, 3 (1).
Hoffmann, Jörg and Gomes, Carla P. and Selman, Bart
(2006)
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Long, Derek and Kautz, Henry A. and Selman, Bart and Bonet, Blai and Geffner, Hector and Koehler, Jana and Brenner, Michael and Hoffmann, Jörg and Rittinger, Frank and Anderson, Corin R. and Weld, Daniel S. and Smith, David E. and Fox, Maria
(2000)
The AIPS-98 Planning Competition.
AI Magazine, 21 (2).
13–33.
This list was generated on Wed Oct 9 11:46:58 2024 CEST.