✦ LIBER ✦

Constraint-based correctness proofs for logic program transformations

✍ Scribed by Pettorossi, Alberto; Proietti, Maurizio; Senni, Valerio

Book ID: 113020192
Publisher: Springer
Year: 2012
Tongue: English
Weight: 397 KB
Volume: 24
Category: Article
ISSN: 0934-5043
DOI: 10.1007/s00165-012-0233-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Totally correct logic program transforma

Totally correct logic program transformations via

✍ Alberto Pettorossi; Maurizio Proietti 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 778 KB

Totally correct logic program transforma

Totally correct logic program transformations via

✍ Alberto Pettorossi; Maurizio Proietti 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 182 KB

Proof method of partial correctness and

Proof method of partial correctness and weak completeness for normal logic programs

✍ Gérard Ferrand; Pierre Deransart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 951 KB

Synthesis and transformation of logic pr

Synthesis and transformation of logic programs using unfold/fold proofs

✍ Alberto Pettorossi; Maurizio Proietti 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 408 KB

We present a method for proving properties of de®nite logic programs. This method is called unfold/fold proof method because it is based on the unfold/fold transformation rules. Given a program and two goals (that is, conjunctions of atoms) p Y and q Y , where , , and are pairwise disjoint vectors o

Constraint logic programming for examina

Constraint logic programming for examination timetabling

✍ P Boizumault; Y Delon; L Peridy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 978 KB

Towards mechanized correctness proofs fo

Towards mechanized correctness proofs for cryptographic algorithms: Axiomatization of a probabilistic Hoare style logic

✍ Jerry den Hartog 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 711 KB