Logic program synthesis from incomplete specifications

DOI10.1016/S0747-7171(06)80012-XzbMath0804.68090OpenAlexW2034493279MaRDI QIDQ1322854

Pierre Flener, Yves Deville

Publication date: 9 May 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(06)80012-x

zbMATH Keywords

correctnesscomparison criteriaincomplete specificationssynthesis of logic programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)

Related Items

Unnamed Item ⋮ Top program construction and reduction for polynomial time meta-interpretive learning ⋮ An abstract formalization of correct schemas for program synthesis ⋮ Logic program synthesis from incomplete specifications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotonic and non-monotonic inductive inference
• Polynomial-time inference of arbitrary pattern languages
• Top-down synthesis of divide-and-conquer algorithms
• Logic program synthesis from incomplete specifications
• Derivation of Logic Programs
• A Methodology for LISP Program Construction from Examples
• A Production Rule Mechanism for Generating LISP Code
• Language identification in the limit