Loading...
Please wait, while we are loading the content...
Similar Documents
On Correctness and Completeness of an n Queens Program
| Content Provider | Scilit |
|---|---|
| Author | Drabent, Włodzimierz |
| Copyright Year | 2021 |
| Description | Thom Frühwirth presented a short, elegant, and efficient Prolog program for the n queens problem. However, the program may be seen as rather tricky and one may not be convinced about its correctness. This paper explains the program in a declarative way and provides proofs of its correctness and completeness. The specification and the proofs are declarative, that is they abstract from any operational semantics. The specification is approximate, it is unnecessary to describe the program’s semantics exactly. Despite the program works on non-ground terms, this work employs the standard semantics, based on logical consequence and Herbrand interpretations. Another purpose of the paper is to present an example of precise declarative reasoning about the semantics of a logic program. |
| Related Links | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/CD974BE79800B9C6C562BBCD046EB08D/S1471068421000223a.pdf/div-class-title-on-correctness-and-completeness-of-an-span-class-italic-n-span-queens-program-div.pdf |
| Ending Page | 50 |
| Page Count | 14 |
| Starting Page | 37 |
| ISSN | 14710684 |
| e-ISSN | 14753081 |
| DOI | 10.1017/s1471068421000223 |
| Journal | Theory and Practice of Logic Programming |
| Issue Number | 1 |
| Volume Number | 22 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2021-10-14 |
| Access Restriction | Open |
| Subject Keyword | Theory and Practice of Logic Programming |
| Content Type | Text |
| Resource Type | Article |
| Subject | Artificial Intelligence Theoretical Computer Science Computational Theory and Mathematics Hardware and Architecture Software |
