S. Ruggieri and D. Pedreschi. Verification of Logic Programs. Submitted for publication, 1997. 15  Home/Search   Document Details and Download   Summary   Related Articles

....domino solitaire problem as a case study Ph. D. course on Verification of Logic Programs S. Contiero, A. Giani fcontiero,gianig di.unipi.it July 16, 1997 1 Description of the problem Aim of this work is to investigate the effective applicability of methods and results introduced in [1, 2, 3, 4] in order to check several useful properties of the solution to the following problem. 1.1 Domino solitaire You are given a set of domino stones. Each stone has 2 numbers (on the same side) one at the left and one at the right, like the examples below show : t t t t t t t t t t t t t t In the ....

....extends the previous one, since the latter can be seen as a particular case (i.e. dominoSol(L, of the former. 2.2 A Prolog solution We now present a possible solution, in term of a Prolog program, for the problem described above. Then we will analyse whether the various properties studied in [1, 2, 3, 4] hold or not for our case. As a starting point, we briefly discuss some initial assumptions adopted. First of all, we assume that the input is represented by a list of ground terms. This has notable consequences on various aspects, as we will point out in the sequel. Furthermore, since every ....

[Article contains additional citation context not shown here]

S. Ruggieri and D. Pedreschi. Verification of Logic Programs. Submitted for publication, 1997. 15

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC