Semantic Learning for Lazy Clause Generation
暂无分享,去创建一个
[1] Christian Bessiere,et al. Proceedings of the 13th international conference on Principles and practice of constraint programming , 2007 .
[2] Peter J. Stuckey,et al. Propagation = Lazy Clause Generation , 2007, CP.
[3] Ian P. Gent. Proceedings of the 15th international conference on Principles and practice of constraint programming , 2009 .
[4] Peter J. Stuckey,et al. Fast Set Bounds Propagation Using a BDD-SAT Hybrid , 2010, J. Artif. Intell. Res..
[5] Peter J. Stuckey,et al. Maximising the Net Present Value for Resource-Constrained Project Scheduling , 2012, CPAIOR.
[6] Peter J. Stuckey,et al. Why Cumulative Decomposition Is Not as Bad as It Sounds , 2009, CP.
[7] Ian P. Gent,et al. Lazy Explanations for Constraint Propagators , 2010, PADL.
[8] Meinolf Sellmann,et al. A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT , 2011, AAAI.
[9] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[10] Meinolf Sellmann,et al. A Complete Multi-valued SAT Solver , 2010, CP.
[11] Peter J. Stuckey,et al. Lazy Clause Generation Reengineered , 2009, CP.
[12] Peter J. Stuckey,et al. Solving RCPSP/max by lazy clause generation , 2012, Journal of Scheduling.
[13] Peter J. Stuckey,et al. Propagation via lazy clause generation , 2009, Constraints.
[14] Peter J. Stuckey,et al. Explaining the cumulative propagator , 2010, Constraints.
[15] Peter J. Stuckey,et al. Efficient constraint propagation engines , 2006, TOPL.