Multi-modal program synthesis refers to the task of synthesizing programs (code) from their specification given in different forms, such as a combination natural language and examples. Examples provide precise but incomplete specification, provides an ambiguous more "complete" description. Machine-learned pre-trained models (PTMs) are adept at handling language, struggle with generating syntact...

What explains the truth of a universal generalization? Two types explanation can be distinguished. While an ‘instance-based explanation’ proceeds via some or all instances generalization, ‘generic is independent instances, relying instead on completely general facts about properties operations involved in generalization. This intuitive distinction analyzed by means truthmaker semantics, which a...

A significant problem in Genetic Programming consists in ensuring the robustness or generality of the evolved code (its ability to work correctly on never before seen data). We examine approaches attempted so far, and propose a different solution, based on multiple training sets (to discriminate between possible interpretations), augmentation and refinement, which improves on both task specific...

We present an abstract communication model. The model is quite general even though it was developed in the process of specifying a particular network architecture, namely the Universal Plug and Play (UPnP) architecture. The generality of the model has been confirmed by its reuse for different architectures. The model is based on distributed abstract state machines and implemented in the specifi...

Flow grammars provide a new mechanism for modelling control flow in flow analyzers and code optimizers. Existing methods for representing control flow are inadequate in terms of both their generality and their accuracy. Flow grammars overcome these deficiencies and are well-suited to the specification and solution of data flow analysis problems.

Binding constraints form one of the most robust modules of grammatical knowledge. Despite their crosslinguistic generality and practical relevance for anaphor resolution, they have resisted full integration into grammar processing. The ultimate reason for this is to be found in the original exhaustive coindexation rationale for their specification and verification. As an alternative, we propose...