✦ LIBER ✦

Inductive Completeness of Logics of Programs

✍ Scribed by Daniel Leivant

Book ID: 108127055
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 265 KB
Volume: 228
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completeness Proofs for Some Logics of P

Completeness Proofs for Some Logics of Programs

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

On strictly arithmetical completeness in

On strictly arithmetical completeness in logics of programs

✍ Andrzej Szalas 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Completing open logic programs by constr

Completing open logic programs by constructive induction

✍ Esra Erdem; Pierre Flener 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

We consider part of the problem of schema-biased inductive synthesis of recursive logic Ž programs from incomplete specifications, such as clausal evidence for instance, but not . necessarily, ground positive and negative examples . After synthesizing the base clause Ž . and introducing recursive ca

Completions of perpetual logic programs

✍ James Hein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Mathematical applications of inductive l

Mathematical applications of inductive logic programming

✍ Simon Colton; Stephen Muggleton 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 698 KB

Logic programs as specifications in the

Logic programs as specifications in the inductive verification of logic programs

✍ Marco Comini; Roberta Gori; Giorgio Levi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB