Semantic definitions for normal open programs
Fernando Orejas, Elvira Pino · 1999
In this paper we study the semantics of normal open programs. In particular, we consider normal open logic programs in full generality, without some usual restrictions considered in previous approaches: in our case, se, 4 is dened allowing to close some, but not necessarily all, open predicates. In this context, two semantic denitions are presented: Q P; denes the semantics of P as a certain set of formula (from a given domain) which are logic consequences of the completion of P : This semantics is shown to be compositional and fully abstract with respect to 30599 The second semantics, FQ (P ), easier to compute than Q P; , is dened as the least xpoint of an immediate consequence continuous operator associated to P . This semantics is only proved to be weakly compositional and fully abstract. 1 Introduction The full applicability of program analysis tools largely depends on the possibility of being able to decompose large programs into units that could be analized...