Epistemic Logic Programs (ELPs), which propose an extension to Answer Set Programming (ASP) with epistemic operators, have their semantic defined, in various ways, in terms of world views, which are sets of belief sets. Several semantic approaches have in fact been proposed over time to characterize world views, and, recently, to also characterize semantic properties that should be met by any semantics for ELPs. We propose a new semantics, easy also from the computational point of view, but effective, also in order to compare the different semantic approaches. We also propose a significant extension to the ELP approach, by allowing epistemic atoms in rule heads
