On Correctness and Completeness of an n Queens Program

DOI10.1017/s1471068421000223zbMath1530.68054arXiv2108.08079MaRDI QIDQ6063871

Włodzimierz Drabent

Publication date: 12 December 2023

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.08079

zbMATH Keywords

logic programmingspecificationdeclarative programmingprogram correctnessprogram completenessnonground answers

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Orthogonal arrays, Latin squares, Room squares (05B15) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof methods of declarative properties of definite programs
• Declarative modeling of the operational behavior of logic languages
• Modular Verification of Recursive Programs
• Strong termination of logic programs
• Logic + control: On program construction and verification
• Verification of logic programs
• Correctness and Completeness of Logic Programs
• Proving correctness and completeness of normal programs – a declarative approach
• S-semantics -- an example