http://www.bibbase.orgPublications Feed. Showing publications since 2009.Tue, 09 Feb 2010 07:42:24 GMTPyRSS2Gen-1.0.0http://blogs.law.harvard.edu/tech/rsshttp://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/DBLP:conf/ijcai/KitchingB109.html<span class=bibbase_paper_titleauthoryear><b>Exploiting Decomposition on Constraint Problems with High Tree-Width.</b> Kitching, M., and Bacchus, F. 2009.</span> <span class=bibbase_paper_venue>In <i>Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009)</i>, 525-531.</span><br><span class=bibbase_paper_content><a href="http://www.cs.toronto.edu/~fbacchus/Papers/KB1_IJCAI09.pdf" onclick="var cframe = document.getElementById('bibbase_controlframe'); cframe.contentWindow.location.href = 'http://www.bibbase.org/cgi-bin/writelog.cgi?servername=www.bibbase.org&followlink=www.cs.toronto.edu/~fbacchus/Papers/KB1_IJCAI09.pdf';")><img src="http://www.bibbase.org/resources/filetypes/pdf.png" alt="Exploiting Decomposition on Constraint Problems with High Tree-Width [PDF]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Exploiting Decomposition on Constraint Problems with High Tree-Width</span></a> <a href="http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/DBLP:conf_ijcai_KitchingB109.bib"><img src="http://www.bibbase.org/resources/filetypes/bib.png" alt="Exploiting Decomposition on Constraint Problems with High Tree-Width [bib]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Bibtex</span></a> </span>http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/DBLP:conf/sat/GoultiaevaIB09.html<span class=bibbase_paper_titleauthoryear><b>Beyond CNF: A Circuit-Based QBF Solver.</b> Goultiaeva, A.; Iverson, V.; and Bacchus, F. 2009.</span> <span class=bibbase_paper_venue>In <i>Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT-2009)</i>, 412-426.</span><br><span class=bibbase_paper_content><a href="http://www.cs.toronto.edu/~fbacchus/Papers/GIB_SAT2009.pdf" onclick="var cframe = document.getElementById('bibbase_controlframe'); cframe.contentWindow.location.href = 'http://www.bibbase.org/cgi-bin/writelog.cgi?servername=www.bibbase.org&followlink=www.cs.toronto.edu/~fbacchus/Papers/GIB_SAT2009.pdf';")><img src="http://www.bibbase.org/resources/filetypes/pdf.png" alt="Beyond CNF: A Circuit-Based QBF Solver [PDF]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Beyond CNF: A Circuit-Based QBF Solver</span></a> <a href="http://dx.doi.org/10.1007/978-3-642-02777-2_38" onclick="var cframe = document.getElementById('bibbase_controlframe'); cframe.contentWindow.location.href = 'http://www.bibbase.org/cgi-bin/writelog.cgi?servername=www.bibbase.org&followlink=dx.doi.org/10.1007/978-3-642-02777-2_38';")><img src="http://www.bibbase.org/resources/filetypes/html.png" alt="Beyond CNF: A Circuit-Based QBF Solver [http://dx.doi.org/10.1007/978-3-642-02777-2_38]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Beyond CNF: A Circuit-Based QBF Solver</span></a> <a href="http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/DBLP:conf_sat_GoultiaevaIB09.bib"><img src="http://www.bibbase.org/resources/filetypes/bib.png" alt="Beyond CNF: A Circuit-Based QBF Solver [bib]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Bibtex</span></a> </span>http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/BBMHSiPwTEP_AIJ_2009.html<span class=bibbase_paper_titleauthoryear><b>A heuristic search approach to planning with temporally extended preferences.</b> Baier, J. A.; Bacchus, F.; and McIlraith, S. A. 2009.</span> <span class=bibbase_paper_venue>173(5--6):593-618.</span><br><span class=bibbase_paper_content><a href="http://dx.doi.org/10.1016/j.artint.2008.11.011" onclick="var cframe = document.getElementById('bibbase_controlframe'); cframe.contentWindow.location.href = 'http://www.bibbase.org/cgi-bin/writelog.cgi?servername=www.bibbase.org&followlink=dx.doi.org/10.1016/j.artint.2008.11.011';")><img src="http://www.bibbase.org/resources/filetypes/html.png" alt="A heuristic search approach to planning with temporally extended preferences [http://dx.doi.org/10.1016/j.artint.2008.11.011]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>A heuristic search approach to planning with temporally extended preferences</span></a> <a href="http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/BBMHSiPwTEP_AIJ_2009.bib"><img src="http://www.bibbase.org/resources/filetypes/bib.png" alt="A heuristic search approach to planning with temporally extended preferences [bib]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Bibtex</span></a> </span>http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/DBLP:conf/ijcai/KitchingB209.html<span class=bibbase_paper_titleauthoryear><b>Set Branching in Constraint Optimization.</b> Kitching, M., and Bacchus, F. 2009.</span> <span class=bibbase_paper_venue>In <i>Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-2009)</i>, 532-537.</span><br><span class=bibbase_paper_content><a href="http://www.cs.toronto.edu/~fbacchus/Papers/KB2_IJCAI09.pdf" onclick="var cframe = document.getElementById('bibbase_controlframe'); cframe.contentWindow.location.href = 'http://www.bibbase.org/cgi-bin/writelog.cgi?servername=www.bibbase.org&followlink=www.cs.toronto.edu/~fbacchus/Papers/KB2_IJCAI09.pdf';")><img src="http://www.bibbase.org/resources/filetypes/pdf.png" alt="Set Branching in Constraint Optimization [PDF]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Set Branching in Constraint Optimization</span></a> <a href="http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/DBLP:conf_ijcai_KitchingB209.bib"><img src="http://www.bibbase.org/resources/filetypes/bib.png" alt="Set Branching in Constraint Optimization [bib]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Bibtex</span></a> </span>http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/BDPSharpSatbyBacktracking_JAIR_2009.html<span class=bibbase_paper_titleauthoryear><b>Solving #SAT and Bayesian Inference with Backtracking Search.</b> Bacchus, F.; Dalmao, S.; and Pitassi, T. 2009.</span> <span class=bibbase_paper_venue><i>J. Artif. Intell. Res. (JAIR)</i>, 34:391-442.</span><br><span class=bibbase_paper_content><a href="http://dx.doi.org/10.1613/jair.2648" onclick="var cframe = document.getElementById('bibbase_controlframe'); cframe.contentWindow.location.href = 'http://www.bibbase.org/cgi-bin/writelog.cgi?servername=www.bibbase.org&followlink=dx.doi.org/10.1613/jair.2648';")><img src="http://www.bibbase.org/resources/filetypes/html.png" alt="Solving #SAT and Bayesian Inference with Backtracking Search [http://dx.doi.org/10.1613/jair.2648]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Solving #SAT and Bayesian Inference with Backtracking Search</span></a> <a href="http://www.bibbase.org/cache/www_cs_toronto_edu_~fbacchus_Papers_list_bib/BDPSharpSatbyBacktracking_JAIR_2009.bib"><img src="http://www.bibbase.org/resources/filetypes/bib.png" alt="Solving #SAT and Bayesian Inference with Backtracking Search [bib]" style="width: 24px; height: 24px; border: 0px" class=bibbase_icon><span style="display: none;" class=bibbase_icon_text>Bibtex</span></a> </span>