Schema-guided synthesis of constraint logic programs

Pierre Flener, Hamza Zidoum, Brahim Hnich

نتاج البحث: Conference contribution

6 اقتباسات (Scopus)

ملخص

By focusing on the families of assignment and permutation problems (such as graph colouring and n-Queens), we show how to adapt D.R. Smith's (1990) KIDS approach for the synthesis of constraint programs (with implicit constraint satisfaction code), rather than applicative Refine programs with explicit constraint propagation and pruning code. Synthesis is guided by a global search schema and can be fully automated with little effort, due to some innovative ideas. CLP (Sets) programs are equivalent in expressiveness to our input specifications. The synthesised CLP (FD) programs would be, after optimising transformations, competitive with carefully hand-crafted ones.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998
ناشرInstitute of Electrical and Electronics Engineers Inc.
الصفحات168-176
عدد الصفحات9
رقم المعيار الدولي للكتب (الإلكتروني)0818687509, 9780818687501
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 1998
منشور خارجيًانعم
الحدث13th IEEE International Conference on Automated Software Engineering, ASE 1998 - Honolulu, United States
المدة: أكتوبر ١٣ ١٩٩٨أكتوبر ١٦ ١٩٩٨

سلسلة المنشورات

الاسمProceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998
مستوى الصوت1998-October

Other

Other13th IEEE International Conference on Automated Software Engineering, ASE 1998
الدولة/الإقليمUnited States
المدينةHonolulu
المدة١٠/١٣/٩٨١٠/١٦/٩٨

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.2200.2213???

بصمة

أدرس بدقة موضوعات البحث “Schema-guided synthesis of constraint logic programs'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا