http://liftothers.org/dokuwiki/ 2026-04-11T10:38:49+00:00 http://liftothers.org/dokuwiki/ http://liftothers.org/dokuwiki/lib/tpl/dokuwiki/images/favicon.ico text/html 2021-06-30T23:42:06+00:00 http://liftothers.org/dokuwiki/doku.php?id=sc330_f2016:prolog1&rev=1625096526&do=diff Objective * Gain experience with logic programming. * Become familiar with Prolog. * Gain understanding of the declarative nature of prolog. Installation For this class, we use SWI-Prolog. You can download binaries for a Windows or macOS system here. Also, there is an unofficial tutorial for installation text/html 2021-06-30T23:42:06+00:00 http://liftothers.org/dokuwiki/doku.php?id=sc330_f2016:prolog2&rev=1625096526&do=diff Objective: To gain deeper experience programming in Prolog, and to implement a simple Sudoku solver. ---------- Prerequisites: Use the latest version of SWI-Prolog, as in the previous Prolog lab. Template code (described below). ---------- Deliverables: You will write a program in prolog that can solve text/html 2021-06-30T23:42:06+00:00 http://liftothers.org/dokuwiki/doku.php?id=sc330_f2016:smaplesolution.pl&rev=1625096526&do=diff % Problem #1, "It's a tie", Dell Logic Puzzles, October 1999 % Each man (mr so-and-so) got a tie from a relative. tie(cupids). tie(happy_faces). tie(leprechauns). tie(reindeer). mr(crow). mr(evans). mr(hurley). mr(speigler). relative(daughter). relative(father_in_law). relative(sister). relative(uncle). solve :- tie(CrowTie), tie(EvansTie), tie(HurleyTie), tie(SpeiglerTie), all_different([CrowTie, EvansTie, HurleyTie, SpeiglerTie]), %This predicate first chooses some ties. %It… text/html 2021-06-30T23:42:06+00:00 http://liftothers.org/dokuwiki/doku.php?id=sc330_f2016:sudoku&rev=1625096526&do=diff % A Sudoku solver. The basic idea is for each position, % check that it is a digit with `digit`. Then verify that the digit % chosen doesn't violate any constraints (row, column, and cube). % If no constraints were violated, proceed further. If a constraint % was violated, then backtrack to the last digit choice and move from % there (the Prolog engine should handle this for you automatically). % If we reach the end of the board with this scheme, it means that % the whole thing is solved. % …