Publication:2949713

{{DISPLAYTITLE:On Completeness of Logic Programs

DOI10.1007/978-3-319-17822-6_15zbMath1353.68034arXiv1411.3015OpenAlexW2963910881MaRDI QIDQ2949713

Włodzimierz Drabent

Publication date: 2 October 2015

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

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

zbMATH Keywords

logic programmingdeclarative programmingprogram completenessapproximate specification

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

On Completeness of Logic Programs, Logic + control: On program construction and verification, Proving completeness of logic programs with the cut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pearl on SAT and SMT solving in Prolog
• Reasoning about termination of pure Prolog programs
• On Completeness of Logic Programs
• The relation between logic programming and logic specification
• The Transformational Approach to Program Development
• Strong termination of logic programs
• The theoretical foundations of LPTP (a logic program theorem prover)
• Transformation of logic programs: Foundations and techniques
• Logic program synthesis
• Inferring non-suspension conditions for logic programs with dynamic scheduling
• Correctness and Completeness of Logic Programs
• Logic + control: An example
• Proving correctness and completeness of normal programs – a declarative approach