Efficient program synthesis using constraint satisfaction in inductive logic programming

MaRDI QIDQ2933968zbMATH OpenFDO

Authors John Ahlgren, Shiu Yin Yuen

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v14/ahlgren13a.html

zbMATH Keywords

constraint satisfactioninductive logic programmingprogram synthesisBoolean satisfiability problemtheory induction

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Recommendations

• Constraint solver synthesis using tabled resolution for constraint logic programming
• Counterexample guided inductive synthesis modulo theories
• Logic program synthesis as problem reduction using combining forms
• Schema induction for logic program synthesis
• Automatic synthesis of constraints from examples using mixed integer linear programming

Cited in

(12)

• scientific article; zbMATH DE number 3868611 (Why is no real title available?)
• Inductive logic programming at 30
• Incremental constraint satisfaction for equational logic programming
• Efficient and Scalable Induction of Logic Programs Using a Deductive Database System
• scientific article; zbMATH DE number 1753138 (Why is no real title available?)
• Automatic synthesis of constraints from examples using mixed integer linear programming
• Learning logic programs by explaining their failures
• Induction of Constraint Logic Programs
• Learning programs by learning from failures
• Fast narrowing-driven partial evaluation for inductively sequential programs
• Constraint solver synthesis using tabled resolution for constraint logic programming
• Schema-Guided Synthesis of Imperative Programs by Constraint Solving

This page was built for publication: Efficient program synthesis using constraint satisfaction in inductive logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933968)