Titlebook: Logic-Based Program Synthesis and Transformation; 16th International S Germán Puebla Conference proceedings 2007 Springer-Verlag Berlin Hei

Ambulatory

Simulate

Constructing Consensus Logic Programsowing two problems: given two programs .. and .., which have the sets of answer sets . and ., respectively; (i) find a program . which has the answer sets as the minimal elements of .; (ii) find a program . which has the answer sets as the maximal elements of the above set. A program . satisfying (i

ineluctable

Supervising Offline Partial Evaluation of Logic Programs Using Online Techniquestic programs. Existing automatic binding-time analyses still only have limited applicability and annotations often have to be created or improved and maintained by hand, leading to errors. We present a technique to help overcome this problem by using online control techniques which supervise the spe

懶惰人民

HUMP

Towards Description and Optimization of Abstract Machines in an Extension of Prolog optimize, and, especially, maintain and extend. This is partly due to the fact that efficiency considerations make it necessary to use low-level languages in their implementation. Writing the abstract machine (and ancillary code) in a higher-level language can help harness this inherent complexity.