The non-deterministic rule-based programming language of Constraint Handling Rules (CHR) features a remarkable combination of desirable properties: a foundation in classical logic, powerful analysis methods for deciding program properties – especially confluence – and an efficient execution model. Upon a closer look, we observe several limitations to this asset.
In this thesis, we introduce several concepts to amend for these short- comings. Firstly, we propose an unusually concise formulation of the two most important semantic interpretations of CHR. Secondly, we analyse the relationship between the major diverging interpretations of CHR. Finally, we found CHR on intuitionistic linear logic.
In this thesis, we introduce several concepts to amend for these short- comings. Firstly, we propose an unusually concise formulation of the two most important semantic interpretations of CHR. Secondly, we analyse the relationship between the major diverging interpretations of CHR. Finally, we found CHR on intuitionistic linear logic.
€29.99
عن المؤلف
The editor Uwe Schöning is a professor of Theoretical Computer Science at the University of Ulm, Germany. He introduced the low and high hierarchies to structural complexity theory to describe the internal structure of the complexity class NP. Later, he invented a much-cited SAT-Algorithm. He has also authored several popular textbooks on Logic in Computer Science.قم بشراء هذا الكتاب الإلكتروني واحصل على كتاب آخر مجانًا!
لغة الإنجليزية ● شكل EPUB ● صفحات 180 ● ISBN 9783738669435 ● حجم الملف 12.8 MB ● محرر Thom Frühwirth & Uwe Schöning ● الناشر Books on Demand ● نشرت 2015 ● الإصدار 1 ● للتحميل 24 الشهور ● دقة EUR ● هوية شخصية 6828267 ● حماية النسخ Adobe DRM
يتطلب قارئ الكتاب الاليكتروني قادرة DRM
المزيد من الكتب الإلكترونية من نفس المؤلف (المؤلفين) / محرر
2٬791 كتب إلكترونية في هذه الفئة
