<div>In order to enable logic programming to deal with the diversity of pervasive systems, where many hetero- geneous domain-specific computational models could benefit from the power of symbolic computation, we exploit the expressive power of labelled systems. To this end, we define a new notion of truth for logic programs extended with labelled variables, interpreted in non-Herbrand domains, where usual terms maintain their Herbrand interpretations.</div>

<div>First, a model for labelled variables in logic programming is defined. Then, the fixed-point and the operational semantics are presented, and the correctness, completeness, and their equivalence are discussed. A meta-interpreter implementing the operational semantics is also introduced, followed by some case studies aimed at showing the effectiveness of our approach in some selected scenarios.</div>