tag:dreamwidth.org,2009-05-08:316975purplecatpurplecatpurplecat2012-05-06T15:18:30Ztag:dreamwidth.org,2009-05-08:316975:67842A Pearl on SAT and SMT Solving in Prolog2012-05-06T15:18:30Z2012-05-06T15:18:30Zpublic3<b>100 Current Papers in Artificial Intelligence, Automated Reasoning and Agent Programming. Number 2</b><br /><br />Jacob M. Howe and Andy King, A Pearl on SAT and SMT Solving in Prolog, <i>Theoretical Computer Science</i> Volume 435, 1 June 2012, Pages 43–55.<br /><b>DOI:</b> <a href="http://dx.doi.org/10.1016/j.bbr.2011.03.031">http://dx.doi.org/10.1016/j.bbr.2011.03.031</a><br /><b>Open Access:</b> Available from Kent School of Computing Publication Index: <a href="http://www.cs.kent.ac.uk/pubs/2012/3136/index.html">http://www.cs.kent.ac.uk/pubs/2012/3136/index.html</a><br /><br />I'm not sure quite how the terminology of a <i>programming pearl</i> arose. It denotes a neat, elegant or otherwise illuminating solution to some programming problem. In this case the programming pearl shows how a solver for a certain sort of logic can be programmed up in only 22 lines of of the Prolog Programming language.<br /><br /><span class="cut-wrapper"><span style="display: none;" id="span-cuttag___1" class="cuttag"></span><b class="cut-open">( </b><b class="cut-text"><a href="https://purplecat.dreamwidth.org/67842.html#cutid1">Details under the Cut</a></b><b class="cut-close"> )</b></span><div style="display: none;" id="div-cuttag___1" aria-live="assertive"></div><br /><br /><img src="https://www.dreamwidth.org/tools/commentcount?user=purplecat&ditemid=67842" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/> comments